Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorRin, Benjamin
dc.contributor.authorVeraar, P.R.
dc.date.accessioned2021-09-02T18:00:33Z
dc.date.available2021-09-02T18:00:33Z
dc.date.issued2021
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/1394
dc.description.abstractIn this thesis, the intersection non-emptiness problem for Deterministic Finite Automata is discussed. By applying certain restrictions to the Deterministic Finite Automata, an algorithm is constructed to analyze whether the given restricted Automata share any common strings. The time complexity of this algorithm is then discussed and compared to previous research on this subject.
dc.description.sponsorshipUtrecht University
dc.format.extent275230
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleIntersection non-emptiness for restricted classes of Deterministic Finite Automata
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.courseuuKunstmatige Intelligentie


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record