Minimal generators of submonoids of A

I. Litovsky

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1991)

  • Volume: 25, Issue: 1, page 3-17
  • ISSN: 0988-3754

How to cite

top

Litovsky, I.. "Minimal generators of submonoids of $A^\infty $." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 25.1 (1991): 3-17. <http://eudml.org/doc/92379>.

@article{Litovsky1991,
author = {Litovsky, I.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {free monoid; infinite words; minimal generator},
language = {eng},
number = {1},
pages = {3-17},
publisher = {EDP-Sciences},
title = {Minimal generators of submonoids of $A^\infty $},
url = {http://eudml.org/doc/92379},
volume = {25},
year = {1991},
}

TY - JOUR
AU - Litovsky, I.
TI - Minimal generators of submonoids of $A^\infty $
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1991
PB - EDP-Sciences
VL - 25
IS - 1
SP - 3
EP - 17
LA - eng
KW - free monoid; infinite words; minimal generator
UR - http://eudml.org/doc/92379
ER -

References

top
  1. 1. J. R. BÜCHI, On Decision Method in Restricted Second-Order Arithmetics, Proc. Congr. Logic, Method. and Philos. Sci., Stanford Univ. Press, Stanford, 1962, pp. 1-11. Zbl0147.25103MR183636
  2. 2. P. DARONDEAU and L. KOTT, A Formal Proof System for Infinitary Rational Expression; I.R.I.S.A. Rept., No. 199, 1983. Zbl0575.68083
  3. 3. DO LONG VAN, Sur les ensembles générateurs minimaux des sous-monoïdes de A∞; C. R. Acad. Sci. Paris, 300, série I, No. 13, 1985. Zbl0578.68063MR794019
  4. 4. S. EILENBERG, Automata, Languages and Machines; A, Academic Press, New York, 1974. Zbl0359.94067MR530382
  5. 5. M. LATTEUX and J. LEGUY, On the Composition of Morphisms and Inverse Morphisms, Lect. Notes Comput. Sci., 1983, 154, pp. 420-432. Zbl0523.68067MR727673
  6. 6. M. LATTEUX and E. TIMMERMAN, Two Characterizations of Rational Adherences, Theor. Comput. Sci., 1986, 46, pp. 101-106. Zbl0618.68066MR868267
  7. 7. I. LITOVSKY and E. TIMMERMAN, On Generators of Rational ω-Power Languages, Theor. Comput. Sci., 1987, 53, pp. 187-200. Zbl0632.68080MR918089
  8. 8. E. TIMMERMAN, The Three Subfamilies of Rational ω-Languages Closed under ω-Transduction (to appear). Zbl0704.68069MR1079528
  9. 9. L. STAIGER, On Infinitary Finite Lenght Codes; Theoretical Informatics and Applications, 1986, 20, No. 4, pp. 483-494. Zbl0628.68056MR880849
  10. 10. L. STAIGER, Reasearch in Theöry of ω-Languages, J. Inf. Process. Cybern., EIK 23, 1987, 8/9, pp. 415-439. Zbl0637.68095MR923334

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.