Sur les semi-groupes vérifiant le théorème de Kleene
RAIRO. Inform. théor., 19 3 (1985) 281-291
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A finiteness criterion for inverse semigroups
C. P. RupertSemigroup Forum 99 (3) 870 (2019)
https://doi.org/10.1007/s00233-019-10015-2
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
MARKUS LOHREY and GÉRAUD SÉNIZERGUESInternational Journal of Algebra and Computation 18 (01) 111 (2008)
https://doi.org/10.1142/S021819670800438X
Slightly Commutative Kleene Semigroups
C.P. RupertJournal of Algebra 192 (1) 235 (1997)
https://doi.org/10.1006/jabr.1996.6958
On finitely recognizable semigroups
Aldo de Luca and Stefano VarricchioActa Informatica 29 (5) 483 (1992)
https://doi.org/10.1007/BF01193579
Which Kleene semigroups are finite?
C.P. RupertTheoretical Computer Science 84 (2) 251 (1991)
https://doi.org/10.1016/0304-3975(91)90162-U
Easy multiplications II. Extensions of rational semigroups
Maryse Pelletier and Jacques SakarovitchInformation and Computation 88 (1) 18 (1990)
https://doi.org/10.1016/0890-5401(90)90003-Z
Equidivisible kleene monoids and the Elgot-Mezei theorem
C. P. RupertSemigroup Forum 40 (1) 129 (1990)
https://doi.org/10.1007/BF02573261
On regular trace languages
Jacques SakarovitchTheoretical Computer Science 52 (1-2) 59 (1987)
https://doi.org/10.1016/0304-3975(87)90080-6
Mathematical Foundations of Computer Science 1986
Jean Berstel and Jacques SakarovitchLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1986 233 15 (1986)
https://doi.org/10.1007/BFb0016231