Article contents
Some Algebraic Properties of Machine Poset of Infinite Words
Published online by Cambridge University Press: 03 June 2008
Abstract
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.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 3: JM'06 , July 2008 , pp. 451 - 466
- Copyright
- © EDP Sciences, 2008
References
- 2
- Cited by