Abstract

We focus on the family of $(k,l)$-unambiguous automata that encompasses the one of deterministic $k$-lookahead automata introduced by Han and Wood. We show that this family presents nice theoretical properties that allow us to compute quasi-deterministic structures. These structures are smaller than DFAs and can be used to solve the membership problem faster than NFAs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call