Geodesic
Some algebraic properties of machine poset of infinite words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 3, pp. 451-466
Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.

DOI : 10.1051/ita:2008009
Classification : 03D40, 20F10
Keywords: infinite words, Mealy machine, poset, algebraic properties 
@article{ITA_2008__42_3_451_0,
     author = {Belovs, Aleksandrs},
     title = {Some algebraic properties of machine poset of infinite words},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {451--466},
     year = {2008},
     publisher = {EDP-Sciences},
     volume = {42},
     number = {3},
     doi = {10.1051/ita:2008009},
     mrnumber = {2434028},
     zbl = {1167.68030},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2008009/}
}
TY  - JOUR
AU  - Belovs, Aleksandrs
TI  - Some algebraic properties of machine poset of infinite words
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2008
SP  - 451
EP  - 466
VL  - 42
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita:2008009/
DO  - 10.1051/ita:2008009
LA  - en
ID  - ITA_2008__42_3_451_0
ER  - 
%0 Journal Article
%A Belovs, Aleksandrs
%T Some algebraic properties of machine poset of infinite words
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2008
%P 451-466
%V 42
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita:2008009/
%R 10.1051/ita:2008009
%G en
%F ITA_2008__42_3_451_0
Belovs, Aleksandrs. Some algebraic properties of machine poset of infinite words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 3, pp. 451-466. doi: 10.1051/ita:2008009

Cité par Sources :