NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY
From MaRDI portal
Publication:5173289
DOI10.1142/S0129054114400115zbMath1320.68111OpenAlexW2142512881MaRDI QIDQ5173289
Markus Holzer, Sebastian Jakobi
Publication date: 9 February 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114400115
regular expressionsfinite automatadescriptional complexitysyntactic monoidsnondeterministic biautomata
Related Items
Cites Work
- From regular expressions to deterministic automata
- A lower bound technique for the size of nondeterministic finite automata
- Intersection and union of regular languages and state complexity
- THE ABSTRACT THEORY OF AUTOMATA
- On the Succinctness of Different Representations of Languages
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- A machine realization of the linear context-free languages
