subword_universal (303B)
1 # Subword universal 2 3 An [automaton] is *subword-universal* if every possible [word] is a [subword] of an accepted word 4 5 can [decide] in [ptime] if [automata_nondeterministic] is subword-universal 6 - cf [rampersad2009computational] Theorem 12 7 8 Up: [universality_automata] 9 10 See also: [subword_automaton]