Operational state complexity of unary NFAs with finite nondeterminism
From MaRDI portal
Publication:896686
DOI10.1016/j.tcs.2015.07.006zbMath1332.68125MaRDI QIDQ896686
Selim G. Akl, Kai Salomaa, Alexandros Palioudakis
Publication date: 10 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.006
finite automata; state complexity; limited nondeterminism; descriptional complexity; unary regular languages; language operations
68Q45: Formal languages and automata