Pages that link to "Item:Q1198953"
From MaRDI portal
The following pages link to On the relation between ambiguity and nondeterminism in finite automata (Q1198953):
Displayed 15 items.
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Regulated nondeterminism in pushdown automata (Q840763) (← links)
- Finite-valued distance automata (Q1341750) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- Some properties of recognizable \(\mathcal Z\)-subsets (Q1870588) (← links)
- Measuring nondeterminism in pushdown automata (Q2575832) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- Regulated Nondeterminism in Pushdown Automata (Q3503897) (← links)
- Distance automata having large finite distance or finite ambiguity (Q4032930) (← links)
- On finite automata with limited nondeterminism (extended abstract) (Q5096848) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)