Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet
Algebra and discrete mathematics, no. 1 (2006), pp. 67-80
Cet article a éte moissonné depuis la source Math-Net.Ru
The classification of inverse semigroups generated by two-state partially defined invertible automata over a two-symbol alphabet is investigated. Two presentations of such semigroups are given. The structures of these semigroups are analyzed.
Keywords:
inverse semigroup, Mealy automata,partially defined Mealy automata
Mots-clés : automaton transformations.
Mots-clés : automaton transformations.
@article{ADM_2006_1_a5,
author = {Janusz Konrad Slupik},
title = {Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet},
journal = {Algebra and discrete mathematics},
pages = {67--80},
year = {2006},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ADM_2006_1_a5/}
}
TY - JOUR AU - Janusz Konrad Slupik TI - Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet JO - Algebra and discrete mathematics PY - 2006 SP - 67 EP - 80 IS - 1 UR - http://geodesic.mathdoc.fr/item/ADM_2006_1_a5/ LA - en ID - ADM_2006_1_a5 ER -
%0 Journal Article %A Janusz Konrad Slupik %T Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet %J Algebra and discrete mathematics %D 2006 %P 67-80 %N 1 %U http://geodesic.mathdoc.fr/item/ADM_2006_1_a5/ %G en %F ADM_2006_1_a5
Janusz Konrad Slupik. Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet. Algebra and discrete mathematics, no. 1 (2006), pp. 67-80. http://geodesic.mathdoc.fr/item/ADM_2006_1_a5/