Unary NFAs with Limited Nondeterminism

DOI10.1007/978-3-319-04298-5_39zbMath1432.68242OpenAlexW40607377MaRDI QIDQ2938121

Kai Salomaa, Alexandros Palioudakis, Selim G. Akl

Publication date: 13 January 2015

Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_39

zbMATH Keywords

finite automatastate complexitylimited nondeterminismunary regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Operational state complexity of unary NFAs with finite nondeterminism ⋮ Nondeterministic Tree Width of Regular Languages

This page was built for publication: Unary NFAs with Limited Nondeterminism