@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}, pages = {151--161}, publisher = {EDP-Sciences}, volume = {26}, number = {2}, year = {1992}, mrnumber = {1166785}, zbl = {0751.20052}, language = {en}, url = {http://archive.numdam.org/item/ITA_1992__26_2_151_0/} }
TY - JOUR AU - Rupert, C. P. TI - Crossability of cancellative Kleene semigroups JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1992 SP - 151 EP - 161 VL - 26 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1992__26_2_151_0/ LA - en ID - ITA_1992__26_2_151_0 ER -
%0 Journal Article %A Rupert, C. P. %T Crossability of cancellative Kleene semigroups %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1992 %P 151-161 %V 26 %N 2 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_1992__26_2_151_0/ %G en %F ITA_1992__26_2_151_0
Rupert, C. P. Crossability of cancellative Kleene semigroups. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 26 (1992) no. 2, pp. 151-161. http://archive.numdam.org/item/ITA_1992__26_2_151_0/
1. Automata, Languages, and Machines: Volume A, Academic Press, 1974. | MR | Zbl
,2. 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 | Zbl
,3. Descriptions de Semigroupes par Automates, Thèse de Doctorat, Université Paris-VI, 1989.
,4. Equidivisible Kleene Monoids and the Elgot-Mezei Theorem, Semigroup Forum, 1990, 40, pp. 129-141. | MR | Zbl
,5. 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 | Zbl
,