Sur le produit avec compteur modulo un nombre premier
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 6, pp. 553-564.
@article{ITA_1992__26_6_553_0,
     author = {P\'eladeau, Pierre},
     title = {Sur le produit avec compteur modulo un nombre premier},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {553--564},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {6},
     year = {1992},
     zbl = {0766.68082},
     mrnumber = {1195745},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1992__26_6_553_0/}
}
TY  - JOUR
AU  - Péladeau, Pierre
TI  - Sur le produit avec compteur modulo un nombre premier
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1992
DA  - 1992///
SP  - 553
EP  - 564
VL  - 26
IS  - 6
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1992__26_6_553_0/
UR  - https://zbmath.org/?q=an%3A0766.68082
UR  - https://www.ams.org/mathscinet-getitem?mr=1195745
LA  - fr
ID  - ITA_1992__26_6_553_0
ER  - 
Péladeau, Pierre. Sur le produit avec compteur modulo un nombre premier. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 6, pp. 553-564. http://www.numdam.org/item/ITA_1992__26_6_553_0/

1. J. A. Brzozowski et R. Knast, The Dot-Depth Hierarchy of Star-Free Languages is Infinite, J. Computer and System Sci., 1978, 16, p. 35-55. | MR 471451 | Zbl 0368.68074

2. S. Eilenberg, Automata, Languages and Machines, Academic Press, 1976, B. | Zbl 0359.94067

3. E. Luca, La Théorie des nombres, tome 1, 1961.

4. P. Péladeau, Classes de circuits booléens et variétés de langages, Thèse de Doctorat, Université Paris-VI, 1990.

5. J. E. Pin, Variétés de langage formels, Masson, Paris, 1984. | MR 752695 | Zbl 0636.68093

6. J.-E. Pin, Topologies for the Free Monoid, Rapport LITP 88.17, J. of Algebra (à paraître). | Zbl 0739.20032

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

8. R. Smolensky, Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity, Proc. 19th ACM STOC, 1987, p. 77-82.

9. H. Straubing, Families of Recognizable Sets Corresponding to Certain Varieties of Finite Monoids, J. Pure Appl. Algebra, 1979, 15, p. 319-327. | MR 537504 | Zbl 0414.20056

10. H. Straubing, A Generalization of the Schützenberger Product of Finite Monoids, Theoret. Comput. Sci., 1981, 13, p. 137-150. | MR 594057 | Zbl 0456.20048

11. H. Straubing, D. Thérien and W. Thomas, Regular Languages Defined with Generalized Quantifiers, Automata, Languages and Programming; Proc. 15th ICALP, Springer, Lectures Notes in Comput. Sci., 1988. | MR 1023662 | Zbl 0658.68098

12. D. Thérien, Classification of Regular Languages by Congruences, Ph. D. Thesis, Univ. of Waterloo, 1980.

13. D. Thérien, Classification of Finite Monoids: the Language Approach, Theoret. Comput. Sci., 1981, 14, p. 195-208. | MR 614416 | Zbl 0471.20055

14. P. Weil, Products of Languages with Counter, Theoret. Comput. Sci., 1990, 76, p. 251-260. | MR 1079529 | Zbl 0704.68071

15. P. Weil, Closure of Varieties of Languages Under Products with Counter, Rapport LITP, p. 89-129. | Zbl 0766.20023