In automata theory, a finite state machine is called a deterministic finite automaton (DFA), if * each of its transitions is uniquely determined by… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Tommy Tracy, Mircea R. Stan, +4 authors Gabriel Robins
- 2015

The Levenshtein Nondeterministic Finite state Automaton (NFA) recognizes input strings within a set edit distance of a configured… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the… (More)

Is this relevant?

2005

2005

- Christos A. Kapoutsis
- MFCS
- 2005

We prove that every two-way nondeterministic finite automaton with n states has an equivalent one-way nondeterministic finite… (More)

Is this relevant?

2005

2005

- Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
- Theor. Comput. Sci.
- 2005

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

- Markus Holzer, Martin Kutrib
- CIAA
- 2002

The state complexities of basic operations on nondeterministic finite automata (NFA) are investigated. In particular, we consider… (More)

Is this relevant?

2001

2001

- Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
- J. Comput. Syst. Sci.
- 2001

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

- Robert Mark Hierons
- Comput. J.
- 1998

A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic finite state machine… (More)

Is this relevant?

1995

1995

- Oliver Matz, Andreas Pottho
- 1995

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

- Gang Luo, Gregor von Bochmann, Alexandre Petrenko
- IEEE Trans. Software Eng.
- 1994

We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as… (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- Satoru Miyano, Takeshi Hayashi
- CAAP
- 1984

Alternating finite automata on o-words are introduced as an extension of nondeterministic finite automata which process infinite… (More)

Is this relevant?