Semigroups defined by automaton extension mapping
Mirosław Osys
Discussiones Mathematicae - General Algebra and Applications, Tome 25 (2005), p. 103-118 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

We study semigroups generated by the restrictions of automaton extension (see, e.g., [3]) and give a characterization of automaton extensions that generate finite semigroups.

Publié le : 2005-01-01
EUDML-ID : urn:eudml:doc:287685 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgaa_1094,
     author = {Miros\l aw Osys},
     title = {Semigroups defined by automaton extension mapping},
     journal = {Discussiones Mathematicae - General Algebra and Applications},
     volume = {25},
     year = {2005},
     pages = {103-118},
     zbl = {1106.68067},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgaa_1094}
}

Mirosław Osys. Semigroups defined by automaton extension mapping. Discussiones Mathematicae - General Algebra and Applications, Tome 25 (2005) pp. 103-118. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgaa_1094/

[000] [1] K. Culik, II, Construction of the Automaton Mapping, (Russian), Apl. Mat. 10 (1965), 459-468.

[001] [2] S. Eilenberg, Automata, Languages and Machines, Volume A, Academic Press, New York 1974.

[002] [3] V.M. Glushkov, Abstract theory of automata, (Russian), Uspehi Mat. Nauk 16 no. 5 (101), (1961), 3-62.

[003] [4] R.I. Grigorchuk, V.V. Nekrashevich and V.I. Sushchanskii, Automata,Dynamical Systems, and Groups, Proc. Steklov Inst. Math. 231 (2000), 128-203. | Zbl 1155.37311

[004] [5] B. Mikolajczak et al. (eds.), Algebraic and Structural Automata Theory, Annals of Discrete Mathematics, vol. 44, North-Holland Publ. Co., Amsterdam 1991.

[005] [6] M. Osys, Automaton extensions of mappings on the set of words defined by finite Mealy automata, Algebra Discrete Math., to appear (preprint 2005). | Zbl 1092.68059

[006] [7] M. Osys, Automaton extensions of transformations of free monoid over finite alphabet (Polish), Zeszyty Nauk. Politech. Śląskiej, Seria Math.-Fiz., no. 91, (2004).

[007] [8] G.N. Raney, Sequential functions, J. Assoc. Comput. Math. 5 (1958), 177-180. | Zbl 0088.01801

[008] [9] Y. Sheng, Regular languages, Handbook of Formal Languages, vol. 1, Springer-Verlag, Berlin 1997, 41-110.