k_ambiguous_nfa (383B)
1 # K ambiguous NFA 2 3 A *k-unambiguous NFA* is an [NFA] where every [word] has at most k [accepting_runs] 4 5 For k=1, we get the notion of [UFAs] 6 7 [Counting_problem] on [density_function] (number of accepted [words]): [sharp_k_UFA] 8 9 - [k_unambiguous_universality] 10 - [k_unambiguous_inclusion] 11 12 Up: [k_ambiguous], [NFA] 13 14 Aliases: k unambiguous NFA 15 16 See also: [word_automaton_k_unambiguous]