Unary NFAs with limited nondeterminism

DOI10.1007/978-3-319-04298-5_39MaRDI QIDQ2938121zbMATH OpenOpenAlexFDO

Authors Alexandros Palioudakis, Kai Salomaa, 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

limited nondeterminismfinite automatastate complexityunary regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Operational state complexity of unary NFAs with finite nondeterminism
• State complexity of unary language operations for NFAs with limited nondeterminism
• Unambiguous finite automata over a unary alphabet
• Mathematical Foundations of Computer Science 2003
• Complementing unary nondeterministic automata

Cited in

(10)

• Branching measures and nearly acyclic NFAs
• Complementing unary nondeterministic automata
• Branching measures and nearly acyclic NFAs
• Limited automata and unary languages
• NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs
• Operational state complexity of unary NFAs with finite nondeterminism
• Nondeterministic tree width of regular languages
• scientific article; zbMATH DE number 7377986 (Why is no real title available?)
• Growth rate of minimum branching
• scientific article; zbMATH DE number 4080940 (Why is no real title available?)

This page was built for publication: Unary NFAs with limited nondeterminism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938121)