Some Algebraic Properties of Machine Poset of Infinite Words

Aleksandrs Belovs

RAIRO - Theoretical Informatics and Applications (2008)

  • Volume: 42, Issue: 3, page 451-466
  • ISSN: 0988-3754

Abstract

top
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.

How to cite

top

Belovs, Aleksandrs. "Some Algebraic Properties of Machine Poset of Infinite Words." RAIRO - Theoretical Informatics and Applications 42.3 (2008): 451-466. <http://eudml.org/doc/250382>.

@article{Belovs2008,
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. },
author = {Belovs, Aleksandrs},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Infinite words; Mealy machine; poset; algebraic properties.; machine posets; Mealy automata; combinatorics on words; applied lattice theory; applied semigroups},
language = {eng},
month = {6},
number = {3},
pages = {451-466},
publisher = {EDP Sciences},
title = {Some Algebraic Properties of Machine Poset of Infinite Words},
url = {http://eudml.org/doc/250382},
volume = {42},
year = {2008},
}

TY - JOUR
AU - Belovs, Aleksandrs
TI - Some Algebraic Properties of Machine Poset of Infinite Words
JO - RAIRO - Theoretical Informatics and Applications
DA - 2008/6//
PB - EDP Sciences
VL - 42
IS - 3
SP - 451
EP - 466
AB - 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.
LA - eng
KW - Infinite words; Mealy machine; poset; algebraic properties.; machine posets; Mealy automata; combinatorics on words; applied lattice theory; applied semigroups
UR - http://eudml.org/doc/250382
ER -

References

top
  1. J. Berstel and J. Karhumäki, Combinatorics on Words – A Tutorial. TUCS Technical Report (No 530, June) (2003).  
  2. J.R. Büchi, 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.  
  3. J. Dassow, Completeness Problems in the Structural Theory of Automata. Mathematical Research (Band 7), Akademie–Verlag, Berlin (1981).  
  4. B.A. Davey and H.A. Priestley, Introduction to Lattices and Order. Cambridge University Press (2002).  
  5. N.J. Fine and H.S. Wilf, Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc.16 (1965) 109–114.  
  6. J. Hartmanis and R.E. Stearns, Algebraic Structure Theory of Sequential Machines. Prentice–Hall, Inc., Englewood Cliffs, New Jersey (1966).  
  7. M. Lothaire, Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 17, Addison–Wesley, Reading, Massachusetts (1983).  
  8. M. Lothaire, Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, Vol. 90, Cambridge University Press, Cambridge (2002).  
  9. A. Luca and S. Varricchio, Finiteness and Regularity in Semigroups and Formal Languages. Springer-Verlag, Berlin, Heidelberg (1999).  
  10. R. McNaughton, Testing and generating infinite sequences by a finite automaton. Inform. Control9 (1966) 521–530.  
  11. G.H. Mealy, A method for synthesizing sequential circuits. Bell System Tech. J.34 (1955) 1045–1079.  
  12. D. Perrin and J.-E. Pin, Infinite words: automata, semigroups, logic and games. Pure Appl. Math.141 (2004).  
  13. B.I. Plotkin, I.Ja. Greenglaz and A.A. Gvaramija, Algebraic Structures in Automata and Databases Theory. World Scientific, Singapore, New Jersey, London, Hong Kong (1992).  
  14. H. Rogers, Theory of recursive functions and effective computability. McGraw-Hill Book Company (1967).  
  15. G.E. Sacks, The recursively enumerable degrees are dense. Ann. Math.80 (1964) 300–312.  
  16. S. Seshu, Mathematical models for sequential machines. IRE Mat. Convent, Rec.7 (1959) 4–16.  
  17. K. Wagner, On ω-regular sets. Informatics and Control43 (1979) 123–177.  
  18. V.B. Kudryavcev, S.V. Aleshin and A.S. Podkolzin, An introduction to the theory of automata. Moskva Nauka (1985) (Russian).  
  19. A.A. Kurmit, Sequential decomposition of finite automata. Riga Zinatne (1982) (Russian).  
  20. B.A. Trahtenbrot and Ya.M. Barzdin, Finite automata, behaviour and synthesis. Moskva Nauka (1970) (Russian).  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.