Pages that link to "Item:Q3395129"
From MaRDI portal
The following pages link to NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129):
Displayed 7 items.
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES (Q2909186) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
