<abstract xmlns="http://www.w3.org/1999/xhtml"><p> We consider in this paper the basis finite automaton and its some properties. We shall also consider some properties of special binary relation defined on the sets of states of canonical automata for the given language and for its mirror image. We shall also consider an algorithm of constructing the basis automaton defining the language which has a priory given variant of this relation.</p></abstract>

We consider in this paper the basis finite automaton and its some properties. We shall also consider some properties of special binary relation defined on the sets of states of canonical automata for the given language and for its mirror image. We shall also consider an algorithm of constructing the basis automaton defining the language which has a priory given variant of this relation.

Some more on the basis finite automaton

Russia, National Research Nuclear University “MEPhI”

Acta Universitatis Sapientiae, Informatica

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

{"article-title":"Some more on the basis finite automaton"}

We consider in this paper the basis finite automaton and its some properties. We shall also consider some properties of special binary relation defined on the...

Some more on the basis finite automaton

Online veröffentlicht: 30. Mai 2014

Seitenbereich: 227 - 244

Eingereicht: 02. Aug. 2013

DOI: https://doi.org/10.2478/ausi-2014-0012

Schlüsselwörter
nondeterministic finite automata, basis automaton, statemarking functions

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Some more on the basis finite automaton

Online veröffentlicht: 30. Mai 2014

Seitenbereich: 227 - 244

Eingereicht: 02. Aug. 2013

DOI: https://doi.org/10.2478/ausi-2014-0012

Schlüsselwörternondeterministic finite automata, basis automaton, statemarking functions

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Schlüsselwörter
nondeterministic finite automata, basis automaton, statemarking functions