Sciweavers

ITA
2008
119views Communications» more  ITA 2008»
13 years 4 months ago
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 ...
Aleksandrs Belovs