On the relation between ambiguity and nondeterminism in finite automata
From MaRDI portal
Publication:1198953
DOI10.1016/0890-5401(92)90014-7zbMath0752.68056OpenAlexW2066768040MaRDI QIDQ1198953
Jonathan Goldstine, Detlef Wotschke, Hing-Man Leung
Publication date: 16 January 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90014-7
Related Items
Finite-valued distance automata ⋮ Regulated nondeterminism in pushdown automata ⋮ IN MEMORIAM CHANDRA KINTALA ⋮ On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata ⋮ On finite automata with limited nondeterminism (extended abstract) ⋮ Distance automata having large finite distance or finite ambiguity ⋮ Regulated Nondeterminism in Pushdown Automata ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ Branching Measures and Nearly Acyclic NFAs ⋮ Measuring nondeterminism in pushdown automata ⋮ Communication complexity method for measuring nondeterminism in finite automata ⋮ Worst Case Branching and Other Measures of Nondeterminism ⋮ Some properties of recognizable \(\mathcal Z\)-subsets
Cites Work
