Nondeterministic finite automaton
Semantic Scholar uses AI to extract papers important to this topic.
The Levenshtein Nondeterministic Finite state Automaton (NFA) recognizes input strings within a set edit distance of a configured… (More)
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the… (More)
We prove that every two-way nondeterministic finite automaton with n states has an equivalent one-way nondeterministic finite… (More)
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e… (More)
The state complexities of basic operations on nondeterministic finite automata (NFA) are investigated. In particular, we consider… (More)
- J. Comput. Syst. Sci.
It is proved that every regular expression of size n can be converted into an equivalent nondeterministic nite automaton (NFA) of… (More)
A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic finite state machine… (More)
We study the minimization problem for nondeterministic nite automata. Two approaches are discussed, based on the construction of… (More)
- IEEE Trans. Software Eng.
We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as… (More)
Alternating finite automata on o-words are introduced as an extension of nondeterministic finite automata which process infinite… (More)