automata_reversible (550B)
1 # Reversible automata 2 3 Described in [pin1992reversible] 4 5 [automata_deterministic] and [automata_co_deterministic] (about [automata_reverse]) 6 7 Extends [automata_bideterministic] by lifting the requirement of having exactly one [initial_state] and exactly one [final_state] 8 9 Class of [formal_language] accepted by a reversible automaton 10 - is closed under [union] 11 - membership given an [automata] can be tested in [ptime] 12 - [pin1992reversible] 13 14 See also: [turing_machine_symmetric], [automata_symmetric], [transducer_reversible] 15 16 Up: [word_automaton]