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.
@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},
     zbl = {0463.20049},
     mrnumber = {618452},
     language = {en},
     url = {http://www.numdam.org/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
DA  - 1981///
SP  - 149
EP  - 159
VL  - 15
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1981__15_2_149_0/
UR  - https://zbmath.org/?q=an%3A0463.20049
UR  - https://www.ams.org/mathscinet-getitem?mr=618452
LA  - en
ID  - ITA_1981__15_2_149_0
ER  - 
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://www.numdam.org/item/ITA_1981__15_2_149_0/

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

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. | MR 486262 | Zbl 0374.94010

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

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. | MR 509018 | Zbl 0388.20050

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

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. | MR 434009 | Zbl 0277.68039

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. | MR 568110 | Zbl 0411.68066

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

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

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

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

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

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