On finite automata with limited nondeterminism

DOI10.1007/S002360050133zbMath0923.68090OpenAlexW375648413MaRDI QIDQ1271338

Hing-Man Leung

Publication date: 11 January 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050133

zbMATH Keywords

nondeterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

IN MEMORIAM CHANDRA KINTALA ⋮ Distance desert automata and the star height problem ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Converting finite width AFAs to nondeterministic and universal finite automata ⋮ Existential and universal width of alternating finite automata ⋮ Minimizing finite automata is computationally hard ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ Measuring nondeterminism in pushdown automata ⋮ Worst Case Branching and Other Measures of Nondeterminism

This page was built for publication: On finite automata with limited nondeterminism