Some Algebraic Properties of Machine Poset of Infinite Words
Department of Mathematics, University of Latvia, Raiņa bulvāris 19, Rīga, Latvia; firstname.lastname@example.org
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.
Mathematics Subject Classification: 03D40 / 20F10
Key words: Infinite words / Mealy machine / poset / algebraic properties.
© EDP Sciences, 2008