Pages that link to "Item:Q1271338"
From MaRDI portal
The following pages link to On finite automata with limited nondeterminism (Q1271338):
Displaying 17 items.
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Improved limitedness theorems on finite automata with distance functions (Q908702) (← links)
- On input-revolving deterministic and nondeterministic finite automata (Q1041031) (← links)
- Finitely nonstationary nondeterministic automata with random input (Q1759520) (← links)
- Limited automata: properties, complexity and variants (Q2179326) (← 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)
- Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (Q3167496) (← links)
- Strongly Limited Automata (Q4589240) (← links)
- (Q4884987) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- Distance desert automata and the star height problem (Q5313718) (← links)
- DFA with a Bounded Activity Level (Q5404937) (← 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)
- Determinism and Nondeterminism in Finite Automata with Advice (Q6163614) (← links)