Some Algebraic Properties of Machine Poset of Infinite Words

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: Journal
• Year: 2008
• Where: ITA
• Authors: Aleksandrs Belovs
• Keywords: Communications, Finite Automaton Transducer, Infinite Words, ITA 2008, Simplest Model