Now showing items 1-2 of 2
Growth Rate of Minimum Branching
(Institut fur Informatik, Justus-Liebig Universitat Giessen, 2018-03-14)
There are different ways of quantifying the nondeterminism used by a nondeterministic finite automaton (NFA). The amount of nondeterminism is measured as a function of the input length. For most ...
State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism
Various approaches of quantifying nondeterminism in nondeterministic finite automata (NFA) are considered. We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input ...