This short note reviews the main contributions of the Ph.D. thesis of Imre Simon. His graduate work had major impact on algebraic theory of automata and thirty years later we are in a good position to appreciate how sensitive he was in selecting good problems, and how clever in solving them!
Mots-clés : algebraic theory of automata, piece-wise testable languages, dot-depth hierarchy
@article{ITA_2005__39_1_297_0, author = {Th\'erien, Denis}, title = {Imre {Simon} : an exceptional graduate student}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {297--304}, publisher = {EDP-Sciences}, volume = {39}, number = {1}, year = {2005}, doi = {10.1051/ita:2005017}, mrnumber = {2132593}, zbl = {1097.68580}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ita:2005017/} }
TY - JOUR AU - Thérien, Denis TI - Imre Simon : an exceptional graduate student JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2005 SP - 297 EP - 304 VL - 39 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ita:2005017/ DO - 10.1051/ita:2005017 LA - en ID - ITA_2005__39_1_297_0 ER -
%0 Journal Article %A Thérien, Denis %T Imre Simon : an exceptional graduate student %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2005 %P 297-304 %V 39 %N 1 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ita:2005017/ %R 10.1051/ita:2005017 %G en %F ITA_2005__39_1_297_0
Thérien, Denis. Imre Simon : an exceptional graduate student. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 39 (2005) no. 1, pp. 297-304. doi : 10.1051/ita:2005017. http://archive.numdam.org/articles/10.1051/ita:2005017/
[1] Dot-depth of star-free events. J. Comput. Syst. Sci. 5 (1971) 1-15. | Zbl
and ,[2] Automata, Languages and Machines, Vol. B. Academic Press, New York (1976). | MR | Zbl
,[3] A semigroup characterisation of dot-depth one languages. RAIRO Inform. Théor. 17 (1984) 321-330. | Numdam | Zbl
,[4] Counter-free automata. MIT Press, Cambridge, Massachussetts (1971). | MR | Zbl
and ,[5] Varieties of Formal Languages. Plenum, London (1986). | MR | Zbl
,[6] Polynomial closure of group languages and open sets of the hall topology. Theor. Comput. Sci. 169 (1996) 185-200. | Zbl
,[7] Polynomial closure and unambiguous product. Theor. Comput. Syst. 30 (1997) 1-39. | Zbl
and ,[8] On finite monoids having only trivial subgroups. Inform. Control 8 (1965) 190-194. | Zbl
,[9] Hierarchies of events with dot-depth one. Ph.D. thesis, University of Waterloo (1972).
,[10] Finite semigroup varieties of the form . J. Pure Appl. Algebra 36 (1985) 53-94. | Zbl
,[11] Partially ordered finite monoids and a theorem of I. Simon. J. Algebra 119 (1988) 393-399. | Zbl
and ,[12] Classification of finite monoids: The language approach. Theor. Comput. Sci. 14 (1981) 195-208. | Zbl
,[13] Graph congruences and wreath products. J. Pure Appl. Algebra 36 (1985) 205-212. | Zbl
and ,[14] Categories as algebra: An essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48 (1987) 83-198. | Zbl
,Cité par Sources :