Amounts of nondeterminism in finite automata
From MaRDI portal
Publication:1134517
DOI10.1007/BF00263994zbMath0423.68016OpenAlexW1978033038MaRDI QIDQ1134517
Chandra M. R. Kintala, Detlef Wotschke
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00263994
Related Items (26)
Closure properties and descriptional complexity of deterministic regular expressions ⋮ Measures of nondeterminism for pushdown automata ⋮ Regulated nondeterminism in pushdown automata ⋮ On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata ⋮ Context-dependent nondeterminism for pushdown automata ⋮ On finite automata with limited nondeterminism (extended abstract) ⋮ Pushdown automata with bounded nondeterminism and bounded ambiguity ⋮ Distance automata having large finite distance or finite ambiguity ⋮ Regulated Nondeterminism in Pushdown Automata ⋮ On multi-head automata with restricted nondeterminism ⋮ Concise description of finite languages ⋮ On measuring nondeterminism in regular languages ⋮ On the degree of ambiguity of finite automata ⋮ On the relation between ambiguity and nondeterminism in finite automata ⋮ One-unambiguous regular languages ⋮ One-unambiguous regular languages ⋮ Minimizing finite automata is computationally hard ⋮ Branching Measures and Nearly Acyclic NFAs ⋮ Transforming a single-valued transducer into a Mealy machine ⋮ Pushdown automata with bounded nondeterminism and bounded ambiguity ⋮ Descriptional complexity of regular languages ⋮ On reducing the number of stack symbols in a PDA ⋮ Concise representations of regular languages by degree and probabilistic finite automata ⋮ Nondeterministics circuits, space complexity and quasigroups ⋮ Worst Case Branching and Other Measures of Nondeterminism ⋮ Some properties of recognizable \(\mathcal Z\)-subsets
This page was built for publication: Amounts of nondeterminism in finite automata
