Pages that link to "Item:Q5096848"
From MaRDI portal
The following pages link to On finite automata with limited nondeterminism (extended abstract) (Q5096848):
Displaying 11 items.
- Improved limitedness theorems on finite automata with distance functions (Q908702) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- A construction on finite automata that has remained hidden (Q1275469) (← links)
- Exponential upper and lower bounds for the order of a regular language (Q1341751) (← links)
- Limited automata: properties, complexity and variants (Q2179326) (← links)
- Input-Driven Pushdown Automata with Limited Nondeterminism (Q2921977) (← links)
- Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (Q3167496) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- (Q4452075) (← links)
- STACS 2004 (Q5309709) (← links)
- (Q5740419) (← links)