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.
| Original language | English |
|---|---|
| Pages (from-to) | 451-466 |
| Number of pages | 16 |
| Journal | RAIRO - Theoretical Informatics and Applications |
| Volume | 42 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2008 |
Keywords
- Algebraic properties
- Infinite words
- Mealy machine
- Poset
Fingerprint
Dive into the research topics of 'Some algebraic properties of machine poset of infinite words'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver