FAQ

Nondeterministic finite automaton

Known as: Nondeterministic Finite State Machine, Epsilon closure, Nondeterministic finite automata 
In automata theory, a finite state machine is called a deterministic finite automaton (DFA), if * each of its transitions is uniquely determined by… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2018
0204019632018

Related topics

Related topics

43 relations
Actor modelAlternating finite automatonAlternating tree automataArden's Rule
(More)

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Nondeterministic finite automaton
Automata theory
Finite-state machine
Expressive power
Regular expression
Counter

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Nondeterministic Finite Automata in Hardware - the Case of the Levenshtein Automaton
The Levenshtein Nondeterministic Finite state Automaton (NFA) recognizes input strings within a set edit distance of a configured… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
2005
2005
Removing Bidirectionality from Nondeterministic Finite Automata
We prove that every two-way nondeterministic finite automaton with n states has an equivalent one-way nondeterministic finite… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
On two-way nondeterministic finite automata with one reversal-bounded counter
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e… (More)
Is this relevant?
2002
2002
State Complexity of Basic Operations on Nondeterministic Finite Automata
The state complexities of basic operations on nondeterministic finite automata (NFA) are investigated. In particular, we consider… (More)
Is this relevant?
2001
2001
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata
It is proved that every regular expression of size n can be converted into an equivalent nondeterministic nite automaton (NFA) of… (More)
Is this relevant?
1998
1998
Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic finite state machine… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1995
1995
Computing Small Nondeterministic Finite Automata
We study the minimization problem for nondeterministic nite automata. Two approaches are discussed, based on the construction of… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method
We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Alternating Finite Automata on omega-Words
Alternating finite automata on o-words are introduced as an extension of nondeterministic finite automata which process infinite… (More)
  • table 1
  • table 2
Is this relevant?