Introduction aux langages reconnaissables
Pin, J. E.
Publications du Département de mathématiques (Lyon), (1984), p. 13-38 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1984-01-01
@article{PDML_1984___6B_A2_0,
     author = {Pin, J. E.},
     title = {Introduction aux langages reconnaissables},
     journal = {Publications du D\'epartement de math\'ematiques (Lyon)},
     year = {1984},
     pages = {13-38},
     mrnumber = {802631},
     zbl = {0548.68076},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/PDML_1984___6B_A2_0}
}

Pin, J. E. Introduction aux langages reconnaissables. Publications du Département de mathématiques (Lyon),  (1984), pp. 13-38. http://gdmltest.u-ga.fr/item/PDML_1984___6B_A2_0/

[1] J. A. Brzozowski, Open problems about regular languages, Formal language theory, perpectives and open problems (R. V. Book éditeur) Academic Press (1980), 23-47.

[2] S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol. A (1974) | Zbl 0359.94067

S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol. B (1976). | Zbl 0359.94067

[3] K. Hashigushi, Regular languages of star height one, Information and Control 53 (1982), 199-210. | MR 715530 | Zbl 0547.68072

[4] W. H. Henneman, Algebraic Theory of Automata, Ph. D. Dissertation, MIT (1971). | MR 2940240

[5] G. Lallement, Semigroups and Combinatorial Applications, Wiley, New-York (1979). | MR 530552 | Zbl 0421.20025

[6] M. Lothaire, Combinatorics on words, Addison Wesley, Encyclopedia of Mathematics 17 (1983). | MR 675953 | Zbl 0514.20045

[7] J. F. Perrot, Variétés de langages et opérations. Theoretical Computer Science 7 (1978), 197-210. | MR 509017 | Zbl 0398.68035

[8] J. E. Pin, Sur le monoïde syntactique de L* lorsque L est un langage fini, Theoretical Computer Science 7 (1978), 211-215. | MR 509018 | Zbl 0388.20050

[9] J. E. Pin, Variétés de langages formels, Masson, Paris, (1984). | MR 752695 | Zbl 0636.68093

[10] W. Thomas, Remark on the Star-Height Problem. | Zbl 0453.68026