Voir la notice de l'article provenant de la source Numdam
@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}, pages = {233--260}, publisher = {EDP-Sciences}, volume = {19}, number = {3}, year = {1985}, mrnumber = {809758}, zbl = {0571.20066}, language = {en}, url = {http://geodesic.mathdoc.fr/item/ITA_1985__19_3_233_0/} }
TY - JOUR AU - König, Roman TI - Reduction algorithms for some classes of aperiodic monoids JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1985 SP - 233 EP - 260 VL - 19 IS - 3 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/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 - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1985 %P 233-260 %V 19 %N 3 %I EDP-Sciences %U http://geodesic.mathdoc.fr/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 - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) no. 3, pp. 233-260. http://geodesic.mathdoc.fr/item/ITA_1985__19_3_233_0/
[0] Transductions and Context-free Languages, Teubner, 1979. | Zbl | MR
,[1] Languages of R-trivial Monoids. Res. Rep. CS-78-32, Waterloo, 1978. | MR
, ,[2] Automata, Languages and Machines. Vol. B, Academic Press, 1979.
,[3] Languages of R-trivial and Related Monoids. Res. Rep. CS-79-18, Waterloo, 1979.
,[4] Beiträge zur algebraischen Theorie der formalen Sprachen. Dissertation, Erlangen, 1983.
,[5] Combinatorics on worlds. Addison-Wesley, 1983. | Zbl | MR
,[6] On Burnside's Problem. Trans. AMS 77, 1954. | Zbl | MR
,[7] Hierarchies of Events with Dot-Depth One. Ph. D. thesis, Waterloo, 1972. | MR
,[8]. Piecewise testable events. LNCS 33, Springer Berlin 1975, 214-222. | Zbl | MR
,