Minimal generators of submonoids of $A^\infty $

Litovsky, I.

Minimal generators of submonoids of

A^{\infty}

Litovsky, I.

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 3-17.

MR Zbl

@article{ITA_1991__25_1_3_0,
     author = {Litovsky, I.},
     title = {Minimal generators of submonoids of $A^\infty $},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {3--17},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {1},
     year = {1991},
     mrnumber = {1104407},
     zbl = {0725.68062},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1991__25_1_3_0/}
}

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
SP  - 3
EP  - 17
VL  - 25
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1991__25_1_3_0/
LA  - en
ID  - ITA_1991__25_1_3_0
ER  -

%0 Journal Article
%A Litovsky, I.
%T Minimal generators of submonoids of $A^\infty $
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 3-17
%V 25
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1991__25_1_3_0/
%G en
%F ITA_1991__25_1_3_0

Litovsky, I. Minimal generators of submonoids of $A^\infty $. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1, pp. 3-17. http://www.numdam.org/item/ITA_1991__25_1_3_0/

Bibliographie
Cité par

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. | MR | Zbl

2. P. Darondeau and L. Kott, A Formal Proof System for Infinitary Rational Expression; I.R.I.S.A. Rept., No. 199, 1983.

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. | MR | Zbl

4. S. Eilenberg, Automata, Languages and Machines; A, Academic Press, New York, 1974. | MR | Zbl

5. M. Latteux and J. Leguy, On the Composition of Morphisms and Inverse Morphisms, Lect. Notes Comput. Sci., 1983, 154, pp. 420-432. | MR | Zbl

6. M. Latteux and E. Timmerman, Two Characterizations of Rational Adherences, Theor. Comput. Sci., 1986, 46, pp. 101-106. | MR | Zbl

7. I. Litovsky and E. Timmerman, On Generators of Rational ω-Power Languages, Theor. Comput. Sci., 1987, 53, pp. 187-200. | MR | Zbl

8. E. Timmerman, The Three Subfamilies of Rational ω-Languages Closed under ω-Transduction (to appear). | MR | Zbl

9. L. Staiger, On Infinitary Finite Lenght Codes; Theoretical Informatics and Applications, 1986, 20, No. 4, pp. 483-494. | Numdam | MR | Zbl

10. L. Staiger, Reasearch in Theöry of ω-Languages, J. Inf. Process. Cybern., EIK 23, 1987, 8/9, pp. 415-439. | MR | Zbl