Hiérarchies de concaténation
Open Access
- 1 January 1984
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 18 (1) , 23-46
- https://doi.org/10.1051/ita/1984180100231
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Some theorems on graph congruencesRAIRO. Informatique théorique, 1983
- A semigroup characterization of dot-depth one languagesRAIRO. Informatique théorique, 1983
- A generalization of the Schützenberger product of finite monoidsTheoretical Computer Science, 1981
- Sur les varietes de langages et de monoïdesPublished by Springer Nature ,1979
- The dot-depth hierarchy of star-free languages is infiniteJournal of Computer and System Sciences, 1978
- Hierarchies of aperiodic languagesRevue française d'automatique informatique recherche opérationnelle. Informatique théorique, 1976
- Piecewise testable eventsPublished by Springer Nature ,1975
- Characterizations of locally testable eventsDiscrete Mathematics, 1973