Pages that link to "Item:Q1271338"
From MaRDI portal
The following pages link to On finite automata with limited nondeterminism (Q1271338):
Displayed 9 items.
- Minimizing finite automata is computationally hard (Q703578) (← 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)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- Distance desert automata and the star height problem (Q5313718) (← 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)