automaton_complete (442B)
1 # Automaton complete 2 3 A [deterministic_automaton] where the [transition_function] is a [total_function], i.e., for every [state] q and [letter] a there is an outgoing [transition] for q and a 4 5 Contrast with [incomplete_automata] where the [transition_function] is [partial] 6 7 We can do [automaton_completion] to transform an [incomplete_automata] into a complete automaton 8 9 Up: [automata_types] 10 11 Aliases: complete automaton, complete automata