À propos de cet article
Publié en ligne: 30 mai 2014
Pages: 227 - 244
Reçu: 02 août 2013
DOI: https://doi.org/10.2478/ausi-2014-0012
Mots clés
© 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.
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.