State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism
From MaRDI portal
Publication:5496200
DOI10.1007/978-3-319-09704-6_29zbMath1332.68124MaRDI QIDQ5496200
Selim G. Akl, Kai Salomaa, Alexandros Palioudakis
Publication date: 7 August 2014
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_29
finite automata; state complexity; limited nondeterminism; unary regular languages; language operations
68Q45: Formal languages and automata