The following pages link to On biautomata (Q4649457):
Displayed 4 items.
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)