Unambiguous automata, ie, nondeterministic automata with the restriction of having at most
one accepting run over a word, have the potential to be used instead of deterministic …

Unambiguous automata are nondeterministic automata in which every word has at most one
accepting run. In this paper we give a polynomial-time algorithm for model checking discrete …

The existential width of an alternating finite automaton (AFA) A on a string w is, roughly
speaking, the number of nondeterministic choices that A uses in an accepting computation …

Suffix trees are an important data structure at the core of optimal solutions to many
fundamental string problems, such as exact pattern matching, longest common substring …

Tree width (respectively, string path width) measures the number of partial (respectively,
complete) computations of a nondeterministic finite automaton (NFA) on a given input. We …

The degree of ambiguity (respectively, the path size) of a nondeterministic automaton, on a
given input, measures the number of accepting computations (respectively, the number of all …

A nondeterministic automaton is finitely ambiguous if for each input there is at most finitely
many accepting runs. We prove that the complement of the ω-language accepted by a …

The difference set Δ s, t of two (nondeterministic, in general) transducers s, t is the set of all
input words for which the output sets of the two transducers are not equal. When the two …

The state complexity, respectively, nondeterministic state complexity of a regular language L
is the number of states of the minimal deterministic, respectively, of a minimal …

Two fundamental classes of finite automata are deterministic and nondeterministic ones
(DFAs and NFAs). Natural intermediate classes arise from bounds on an NFA's allowed …