Reduction algorithms for some classes of aperiodic monoids
RAIRO. Informatique théorique, Tome 19 (1985) no. 3, pp. 233-260. 
@article{ITA_1985__19_3_233_0,
     author = {K\"onig, Roman},
     title = {Reduction algorithms for some classes of aperiodic monoids},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {233--260},
     publisher = {EDP-Sciences},
     volume = {19},
     number = {3},
     year = {1985},
     mrnumber = {809758},
     zbl = {0571.20066},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1985__19_3_233_0/}
}
TY  - JOUR
AU  - König, Roman
TI  - Reduction algorithms for some classes of aperiodic monoids
JO  - RAIRO. Informatique théorique
PY  - 1985
SP  - 233
EP  - 260
VL  - 19
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1985__19_3_233_0/
LA  - en
ID  - ITA_1985__19_3_233_0
ER  - 
%0 Journal Article
%A König, Roman
%T Reduction algorithms for some classes of aperiodic monoids
%J RAIRO. Informatique théorique
%D 1985
%P 233-260
%V 19
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1985__19_3_233_0/
%G en
%F ITA_1985__19_3_233_0
König, Roman. Reduction algorithms for some classes of aperiodic monoids. RAIRO. Informatique théorique, Tome 19 (1985) no. 3, pp. 233-260. http://www.numdam.org/item/ITA_1985__19_3_233_0/

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

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

[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 | Zbl

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

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

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