RAIRO-Theor. Inf. Appl.
Volume 42, Number 3, July-September 2008JM'06
|Page(s)||451 - 466|
|Published online||03 June 2008|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.