On the hierarchy of generalizations of one-unambiguous regular languages

DOI10.1016/j.tcs.2016.07.004zbMath1371.68143OpenAlexW2461666527MaRDI QIDQ2357109

Pascal Caron, Ludovic Mignot, Clément Miklarz

Publication date: 19 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.004

zbMATH Keywords

one-unambiguous languagesblock determinismlookahead determinism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Generalizations of 1-deterministic regular languages
• Characterization of Glushkov automata
• THE ABSTRACT THEORY OF AUTOMATA
• (k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization
• Programming Techniques: Regular expression search algorithm
• Derivatives of Regular Expressions
• One-unambiguous regular languages

This page was built for publication: On the hierarchy of generalizations of one-unambiguous regular languages