Reversible automata with multiple initial states recognize more languages than sweeping reversible automata, which recognize more than single-start one-way reversible automata and permutation automata.
PSPACE-complete problems for subgroups of free groups and inverse finite automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A hierarchy of reversible finite automata
Reversible automata with multiple initial states recognize more languages than sweeping reversible automata, which recognize more than single-start one-way reversible automata and permutation automata.