Lattice structures of automata
| dc.contributor.author | Atani, Shahabaddin Ebrahimi | |
| dc.contributor.author | Sedghi Shanbeh Bazari, Maryam | |
| dc.contributor.department | Other | tr_TR |
| dc.contributor.faculty | Other | tr_TR |
| dc.date.accessioned | 2021-11-23T08:34:48Z | |
| dc.date.available | 2021-11-23T08:34:48Z | |
| dc.date.issued | 2020-12-31 | |
| dc.description.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. | tr_TR |
| dc.description.index | Trdizin | tr_TR |
| dc.identifier.endpage | 1145 | tr_TR |
| dc.identifier.issn/e-issn | 2618-6470 | |
| dc.identifier.issue | 2 | tr_TR |
| dc.identifier.startpage | 1133 | tr_TR |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.675691 | tr_TR |
| dc.identifier.uri | http://hdl.handle.net/20.500.12575/76225 | |
| dc.identifier.volume | 69 | tr_TR |
| dc.language.iso | en | tr_TR |
| dc.publisher | Ankara Üniversitesi Fen Fakültesi | tr_TR |
| dc.relation.isversionof | 10.31801/cfsuasmas.675691 | tr_TR |
| dc.relation.journal | Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics | tr_TR |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | tr_TR |
| dc.subject | Automaton | tr_TR |
| dc.subject | Subautomaton | tr_TR |
| dc.subject | Upper semilattice | tr_TR |
| dc.title | Lattice structures of automata | tr_TR |
| dc.type | Article | tr_TR |