On finite automata with limited nondeterminism
From MaRDI portal
Publication:1271338
DOI10.1007/s002360050133zbMath0923.68090MaRDI QIDQ1271338
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
68Q45: Formal languages and automata
Related Items
Worst Case Branching and Other Measures of Nondeterminism, 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, Measuring nondeterminism in pushdown automata, From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity, IN MEMORIAM CHANDRA KINTALA