The following pages link to Inherently nonplanar automata (Q1217777):
Displaying 7 items.
- Nondeterminism versus determinism of finite automata over directed acyclic graphs (Q1326955) (← links)
- Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata (Q2708953) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- The genus of regular languages (Q4599611) (← links)
- Decidability of regular language genus computation (Q5108538) (← links)
- The genus of regular languages and directed graph emulators (Q6495791) (← links)