Comparisons between Measures of Nondeterminism on Finite Automata

DOI10.1007/978-3-642-39310-5_21zbMath1388.68177OpenAlexW76241432MaRDI QIDQ2843098

Kai Salomaa, Alexandros Palioudakis, Selim G. Akl

Publication date: 9 August 2013

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39310-5_21

zbMATH Keywords

finite automatastate complexitylimited nondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Operational state complexity of unary NFAs with finite nondeterminism ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Structural properties of NFAs and growth rates of nondeterminism measures

This page was built for publication: Comparisons between Measures of Nondeterminism on Finite Automata