automata_bideterministic (477B)
1 # Automata bideterministic 2 3 [automata] which are [deterministic] and where the [automata_reversal] is also [deterministic] 4 - in particular exactly one [initial_state] and [final_state] 5 6 Characterization: a [formal_language] is recognized by a bideterministic automaton iff the [minimal_automaton] of the language is reversible and has a unique [final_state] ([pin1992reversible] proposition 2.1) 7 8 Generalization: [automata_reversible] [pin1992reversible] 9 10 Up: [word_automaton]