Lattice structures of automata

Authors : Shahabaddin Ebrahimi ATANİ, Maryam SEDGHİ SHANBEH BAZARİ

Pages : 1133-1145

Doi:10.31801/cfsuasmas.675691

View : 9 | Download : 6

Publication Date : 2020-12-31

Article Type : Research Paper

Abstract :This paper is motivated by the results in [M. Ito, Algebraic structures of automata, Theoretical Computer Science 428 insert ignore into journalissuearticles values(2012); 164-168.]. Structures and the number of subautomata of a finite automaton are investigated. It is shown that the set of all subautomata of a finite automaton A is upper semilattice. We give conditions which allow us to determine whether for a finite upper semilattice insert ignore into journalissuearticles values(L;≤); there exists an automaton A such that the set of all subautomata of A under set inclusion is isomorphic to insert ignore into journalissuearticles values(L;≤);. Examples illustrating the results are presented.
Keywords : Automaton, Subautomaton, upper semilattice, decomposition of an automaton, crisp deterministic fuzzy automaton