Pages that link to "Item:Q912641"
From MaRDI portal
The following pages link to On measuring nondeterminism in regular languages (Q912641):
Displayed 31 items.
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
- Regulated nondeterminism in pushdown automata (Q840763) (← links)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- Context-dependent nondeterminism for pushdown automata (Q880177) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- Two-dimensional hierarchies of proper languages of lexicalized FRR-automata (Q1041046) (← links)
- On the relation between ambiguity and nondeterminism in finite automata (Q1198953) (← links)
- Measures of nondeterminism for pushdown automata (Q1337469) (← links)
- Pushdown automata with bounded nondeterminism and bounded ambiguity (Q1391304) (← links)
- Succinct representations of languages by DFA with different levels of reliability (Q1763718) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- State complexity of partial word finite automata (Q2096588) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← 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)
- On reducing the number of stack symbols in a PDA (Q3141998) (← links)
- Regulated Nondeterminism in Pushdown Automata (Q3503897) (← links)
- A Measure for the Degree of Nondeterminism of Context-Free Languages (Q3503906) (← links)
- Distance automata having large finite distance or finite ambiguity (Q4032930) (← links)
- Measuring nondeterminism in pushdown automata (Q5048932) (← links)
- Pushdown automata with bounded nondeterminism and bounded ambiguity (Q5096344) (← 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)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)
- Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)
- Existential and universal width of alternating finite automata (Q6175087) (← links)