(k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization

DOI10.1007/978-3-319-04921-2_21zbMath1408.68089OpenAlexW53691554MaRDI QIDQ5404917

Pascal Caron, Ludovic Mignot, Marianne Flouret

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the Hierarchy of Block Deterministic Languages ⋮ On the hierarchy of generalizations of one-unambiguous regular languages

This page was built for publication: (k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization