Lattice structures of automata
No Thumbnail Available
Files
Date
2020-12-31
Journal Title
Journal ISSN
Volume Title
Publisher
Ankara Üniversitesi Fen Fakültesi
Abstract
This paper is motivated by the results in [M. Ito, Algebraic structures of automata, Theoretical Computer Science 428 (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 (L;≤) there exists an automaton A such that the set of all subautomata of A under set inclusion is isomorphic to (L;≤). Examples illustrating the results are presented.
Description
Keywords
Automaton, Subautomaton, Upper semilattice