Browsing School of Computing Graduate Theses by Author "Keeler, Chris"
Now showing items 1-1 of 1
-
New metrics for finite automaton complexity and subregular language hierarchies
Keeler, ChrisThe degree of ambiguity of nondeterministic finite automata (NFA) has been studied significantly since at least the 1980s. Roughly speaking, the degree of ambiguity counts the number of accepting computations of an ...