Geodesic
Relational morphisms and operations on recognizable sets
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981) no. 2, pp. 149-159.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1981__15_2_149_0,
     author = {Straubing, Howard},
     title = {Relational morphisms and operations on recognizable sets},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {149--159},
     publisher = {EDP-Sciences},
     volume = {15},
     number = {2},
     year = {1981},
     mrnumber = {618452},
     zbl = {0463.20049},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1981__15_2_149_0/}
}
TY  - JOUR
AU  - Straubing, Howard
TI  - Relational morphisms and operations on recognizable sets
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1981
SP  - 149
EP  - 159
VL  - 15
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1981__15_2_149_0/
LA  - en
ID  - ITA_1981__15_2_149_0
ER  - 
%0 Journal Article
%A Straubing, Howard
%T Relational morphisms and operations on recognizable sets
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1981
%P 149-159
%V 15
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1981__15_2_149_0/
%G en
%F ITA_1981__15_2_149_0
Straubing, Howard. Relational morphisms and operations on recognizable sets. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981) no. 2, pp. 149-159. http://geodesic.mathdoc.fr/item/ITA_1981__15_2_149_0/

1. S. Eilenberg, Automata, Languages and Machines, Vol. B., Academic Press, New York, 1976. | Zbl | MR

2. J. F. Perrot, On the Theory of Syntactic Monoids for Rational Languages, in Fundamentals of Computation Theory, Lecture Notes in Computer Science, No. 56, Springer, 1977, pp. 152-165. | Zbl | MR

3. J. F. Perrot, Variétés des langages et opérations, Theoretical Computer Science, Vol. 7, 1978, pp. 198-210. | Zbl | MR

4. J. E. Pin, Sur le monoïde syntactique de L* lorsque L est un langage fini, Theoretical Computer Science, Vol. 7, 1978, pp. 211-215. | Zbl | MR

5. J. E. Pin, Variétés de langages et monoïde des parties, to appear in Semigroup Forum. | Zbl | MR

6. A. Restivo, Codes and Aperiodic Languages, in Fachtagung übër Automatentheorie und formale Sprachen, Lecture Notes in Computer Science, No. 2, Springer, 1973, pp. 175-181. | Zbl | MR

7. C. Reutenauer, Sur les variétés de langages et de monoïdes, 4th G. I. Conference, Lecture Notes in Computer Science, No. 67, Springer, 1979, pp. 260-265. | Zbl | MR

8. M. P. Schützenberger, On Finite Monoids Having Only Trivial Subgroups, Information and Control, Vol. 8, 1965, pp. 190-194. | Zbl | MR

9. M. P. Schützenberger, Sur le produit de concatenation non ambigu, Semigroup Forum, Vol. 13, 1976, pp. 47-75. | Zbl | MR

10. H. Straubing, Aperiodic Homomorphisms and The Concatenation Product of Recognizable Sets, J. Pure and Applied Algebra, Vol. 15, 1979, pp. 319-327. | Zbl | MR

11. H. Straubing, A Generalization of the Schützenberger Product of Finite Monoids, to appear in Theoretical Computer Science, Vol. 12, 1980. | Zbl | MR

12. H. Straubing, Recognizable Sets and Power Sets of Finite Semigroups, Semigroup Forum, Vol. 18, 1979, pp. 331-340. | Zbl | MR

13. B. Tilson, Chapter XII in Reference [1].