Crossability of cancellative Kleene semigroups
Rupert, C. P.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992), p. 151-161 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1992-01-01
@article{ITA_1992__26_2_151_0,
     author = {Rupert, C. P.},
     title = {Crossability of cancellative Kleene semigroups},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {26},
     year = {1992},
     pages = {151-161},
     mrnumber = {1166785},
     zbl = {0751.20052},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1992__26_2_151_0}
}

Rupert, C. P. Crossability of cancellative Kleene semigroups. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) pp. 151-161. http://gdmltest.u-ga.fr/item/ITA_1992__26_2_151_0/

1. S. Eilenberg, Automata, Languages, and Machines: Volume A, Academic Press, 1974. | MR 530382 | Zbl 0317.94045

2. J. H. Johnson, DO Rational Equivalence Relations have Regular Cross-Sections? Proc. 12th Internat. Conf. on Automata, Languages, and Programrning, Lecture Notes in Comput. Sci., 1985, 194, Springer-Verlag, pp. 300-309. | MR 819265 | Zbl 0571.68069

3. M. Pelletier, Descriptions de Semigroupes par Automates, Thèse de Doctorat, Université Paris-VI, 1989.

4. C. Rupert, Equidivisible Kleene Monoids and the Elgot-Mezei Theorem, Semigroup Forum, 1990, 40, pp. 129-141. | MR 1029250 | Zbl 0685.20048

5. J. Sakarovitch, Deux Remarques sur un Théorème de S. Eilenberg, R.A.I.R.O. Inform. Théor, Appl., 1983, 17, pp. 23-48. | Numdam | MR 701986 | Zbl 0512.68063