(k,l)-Unambiguity and Quasi-Deterministic Structures
Formal Languages and Automata Theory
2017-05-12 v2
Abstract
We focus on the family of -unambiguous automata that encompasses the one of deterministic -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.
Keywords
Cite
@article{arxiv.1406.3214,
title = {(k,l)-Unambiguity and Quasi-Deterministic Structures},
author = {Pascal Caron and Marianne Flouret and Ludovic Mignot},
journal= {arXiv preprint arXiv:1406.3214},
year = {2017}
}