6533b861fe1ef96bd12c571e

RESEARCH PRODUCT

Some Algebraic Properties of Machine Poset of Infinite Words

Aleksandrs Belovs

subject

Mealy machineDiscrete mathematicsFinite-state machineGeneral MathematicsEssential supremum and essential infimumInfimum and supremumComputer Science ApplicationsTransformation (function)Chain (algebraic topology)Point (geometry)Partially ordered setComputer Science::Formal Languages and Automata TheorySoftwareMathematics

description

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.

yearjournalcountryeditionlanguage
2008-06-03RAIRO - Theoretical Informatics and Applications
https://doi.org/10.1051/ita:2008009