universality_automata (557B)
1 # Universality automata 2 3 The [computational_problem] of testing if an [automaton] accepts every possible [word] 4 5 - [universality_automata_nondeterministic]: [conp_complete] 6 - [universality_automata_deterministic]: [ptime] 7 - [universality_context_free_grammar] 8 - [universality_automata_pushdown] 9 10 - [factor_universal] 11 - [subword_universal] 12 13 Variant: [length_universality_automata] 14 15 Up: [universality_problem], [automata_problems] 16 17 See also: [totality], [validity], [taulology], [automaton_emptiness] 18 19 Aliases: automata universality, automaton universality