Pages that link to "Item:Q3618565"
From MaRDI portal
The following pages link to Descriptional and Computational Complexity of Finite Automata (Q3618565):
Displaying 15 items.
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Computational complexity of decision problems on self-verifying finite automata (Q1622990) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- Descriptional Complexity of Operations on Alternating and Boolean Automata (Q2907501) (← links)
- (Q3156501) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- (Q3517106) (← links)
- Computability by finite automata and pisot bases (Q4298373) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- STACS 2004 (Q5309709) (← links)