Reduction algorithms for some classes of aperiodic monoids
König, Roman
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985), p. 233-260 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1985-01-01
@article{ITA_1985__19_3_233_0,
     author = {K\"onig, Roman},
     title = {Reduction algorithms for some classes of aperiodic monoids},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {19},
     year = {1985},
     pages = {233-260},
     mrnumber = {809758},
     zbl = {0571.20066},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1985__19_3_233_0}
}

König, Roman. Reduction algorithms for some classes of aperiodic monoids. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) pp. 233-260. http://gdmltest.u-ga.fr/item/ITA_1985__19_3_233_0/

[0] J. Berstel, Transductions and Context-free Languages, Teubner, 1979. | MR 549481 | Zbl 0424.68040

[1] J. A. Brzozowski, F. E. Fich, Languages of R-trivial Monoids. Res. Rep. CS-78-32, Waterloo, 1978. | MR 566640

[2] S. Eilenberg, Automata, Languages and Machines. Vol. B, Academic Press, 1979.

[3] F. E. Fich, Languages of R-trivial and Related Monoids. Res. Rep. CS-79-18, Waterloo, 1979.

[4] R. König, Beiträge zur algebraischen Theorie der formalen Sprachen. Dissertation, Erlangen, 1983.

[5] M. Lothaire, Combinatorics on worlds. Addison-Wesley, 1983. | MR 675953 | Zbl 0514.20045

[6] R. C. Lyndon, On Burnside's Problem. Trans. AMS 77, 1954. | MR 64049 | Zbl 0058.01702

[7] I. Simon, Hierarchies of Events with Dot-Depth One. Ph. D. thesis, Waterloo, 1972. | MR 2623305

[8]. I. Simon, Piecewise testable events. LNCS 33, Springer Berlin 1975, 214-222. | MR 427498 | Zbl 0316.68034