ScholarLens Back to search
2005•International Journal of Foundations of Computer ScienceRequires access

MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON

Libor Polák

Open publisher page 34 citations

Abstract

As is well known, each minimal NFA for a regular language L is isomorphic to a subautomaton of the so-called universal automaton [Formula: see text] for L. We explore and compare various conditions on sets of states of [Formula: see text] which are related to the fact that induced subautomata of [Formula: see text] accept the whole language L. The methods of several previous works on minimalizations of NFA can be modified so that they fit in our approach. We also propose a new algorithm which is easy to implement.

About this research paper

What this paper is about

As is well known, each minimal NFA for a regular language L is isomorphic to a subautomaton of the so-called universal automaton [Formula: see text] for L. We explore and compare various conditions on sets of states of [Formula: see text] which are related to the fact that induced subautomata of [Formula: see text] accept the whole language L. The methods of several previous works on minimalizations of NFA can be modified so that they fit in our approach. We also propose a new algorithm which is easy to implement.

Why it matters

OpenAlex reports 34 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

As is well known, each minimal NFA for a regular language L is isomorphic to a subautomaton of the so-called universal automaton [Formula: see text] for L. We explore and compare various conditions on sets of states of [Formula: see text] which are related to the fact that induced subautomata of [Formula: see text] accept the whole language L. The methods of several previous works on minimalizations of NFA can be modified so that they fit in our approach. We also propose a new algorithm which is easy to implement.

Key concepts: Büchi automaton, Automaton, Computer science, Nondeterministic finite automaton, Two-way deterministic finite automaton, Deterministic automaton, Regular expression, Finite-state machine

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON — Research Paper | ScholarLens