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.
@article{ITA_2008__42_3_451_0,
author = {Belovs, Aleksandrs},
title = {Some algebraic properties of machine poset of infinite words},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {42},
year = {2008},
pages = {451-466},
doi = {10.1051/ita:2008009},
mrnumber = {2434028},
zbl = {1167.68030},
language = {en},
url = {http://dml.mathdoc.fr/item/ITA_2008__42_3_451_0}
}
Belovs, Aleksandrs. Some algebraic properties of machine poset of infinite words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) pp. 451-466. doi : 10.1051/ita:2008009. http://gdmltest.u-ga.fr/item/ITA_2008__42_3_451_0/
[1] and , Combinatorics on Words - A Tutorial. TUCS Technical Report (No 530, June) (2003). | MR 1965433
[2] , On a Decision Method in Restricted Second Order Arithmetic, in Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science, edited by E. Nagel et al., Stanford Univ. Press, Stanford, CA (1960) 1-11. | MR 183636
[3] , Completeness Problems in the Structural Theory of Automata. Mathematical Research (Band 7), Akademie-Verlag, Berlin (1981). | MR 654860 | Zbl 0481.68052
[4] and , Introduction to Lattices and Order. Cambridge University Press (2002). | MR 1902334 | Zbl 1002.06001
[5] and , Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc. 16 (1965) 109-114. | MR 174934 | Zbl 0131.30203
[6] and , Algebraic Structure Theory of Sequential Machines. Prentice-Hall, Inc., Englewood Cliffs, New Jersey (1966). | MR 204224 | Zbl 0154.41701
[7] , Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley, Reading, Massachusetts (1983). | MR 675953 | Zbl 0514.20045
[8] , Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 90, Cambridge University Press, Cambridge (2002). | MR 1905123 | Zbl 1001.68093
[9] and , Finiteness and Regularity in Semigroups and Formal Languages. Springer-Verlag, Berlin, Heidelberg (1999). | MR 1696498 | Zbl 0935.68056
[10] , Testing and generating infinite sequences by a finite automaton. Inform. Control 9 (1966) 521-530. | MR 213241 | Zbl 0212.33902
[11] , A method for synthesizing sequential circuits. Bell System Tech. J. 34 (1955) 1045-1079. | MR 73450
[12] and , Infinite words: automata, semigroups, logic and games. Pure Appl. Math. 141 (2004). | Zbl 1094.68052
[13] , and , Algebraic Structures in Automata and Databases Theory. World Scientific, Singapore, New Jersey, London, Hong Kong (1992). | Zbl 0875.68657
[14] , Theory of recursive functions and effective computability. McGraw-Hill Book Company (1967). | MR 224462 | Zbl 0183.01401
[15] , The recursively enumerable degrees are dense. Ann. Math. 80 (1964) 300-312. | MR 166089 | Zbl 0135.00702
[16] , Mathematical models for sequential machines. IRE Mat. Convent, Rec. 7 (1959) 4-16.
[17] , On -regular sets. Informatics and Control 43 (1979) 123-177. | MR 553694 | Zbl 0434.68061
[18] , and , An introduction to the theory of automata. Moskva Nauka (1985) (Russian).
[19] , Sequential decomposition of finite automata. Riga Zinatne (1982) (Russian). | MR 684837
[20] and , Finite automata, behaviour and synthesis. Moskva Nauka (1970) (Russian). | MR 265078