Imre Simon: an exceptional graduate student
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 39, Issue: 1, page 297-304
- ISSN: 0988-3754
Access Full Article
top
Abstract
topHow to cite
topThérien, Denis. "Imre Simon: an exceptional graduate student." RAIRO - Theoretical Informatics and Applications 39.1 (2010): 297-304. <http://eudml.org/doc/92762>.
@article{Thérien2010,
abstract = {
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!
},
author = {Thérien, Denis},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Algebraic theory of automata; piece-wise testable languages;
dot-depth hierarchy.},
language = {eng},
month = {3},
number = {1},
pages = {297-304},
publisher = {EDP Sciences},
title = {Imre Simon: an exceptional graduate student},
url = {http://eudml.org/doc/92762},
volume = {39},
year = {2010},
}
TY - JOUR
AU - Thérien, Denis
TI - Imre Simon: an exceptional graduate student
JO - RAIRO - Theoretical Informatics and Applications
DA - 2010/3//
PB - EDP Sciences
VL - 39
IS - 1
SP - 297
EP - 304
AB -
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!
LA - eng
KW - Algebraic theory of automata; piece-wise testable languages;
dot-depth hierarchy.
UR - http://eudml.org/doc/92762
ER -
References
top- R.S. Cohen and J.A. Brzozowski, Dot-depth of star-free events. J. Comput. Syst. Sci.5 (1971) 1–15.
- S. Eilenberg, Automata, Languages and Machines, Vol. B. Academic Press, New York (1976).
- R. Knast, A semigroup characterisation of dot-depth one languages. RAIRO Inform. Théor.17 (1984) 321–330.
- R. McNaughton and S. Papert, Counter-free automata. MIT Press, Cambridge, Massachussetts (1971).
- J.E. Pin, Varieties of Formal Languages. Plenum, London (1986).
- J.E. Pin, Polynomial closure of group languages and open sets of the hall topology. Theor. Comput. Sci.169 (1996) 185–200.
- J.E. Pin and P. Weil, Polynomial closure and unambiguous product. Theor. Comput. Syst.30 (1997) 1–39.
- M. Schützenberger, On finite monoids having only trivial subgroups. Inform. Control8 (1965) 190–194.
- I. Simon, Hierarchies of events with dot-depth one. Ph.D. thesis, University of Waterloo (1972).
- H. Straubing, Finite semigroup varieties of the form V ∗ D. J. Pure Appl. Algebra36 (1985) 53–94.
- H. Straubing and D. Thérien, Partially ordered finite monoids and a theorem of I. Simon. J. Algebra119 (1988) 393–399.
- D. Thérien, Classification of finite monoids: The language approach. Theor. Comput. Sci.14 (1981) 195–208.
- D. Thérien and A. Weiss, Graph congruences and wreath products. J. Pure Appl. Algebra36 (1985) 205–212.
- B. Tilson, Categories as algebra: An essential ingredient in the theory of monoids. J. Pure Appl. Algebra48 (1987) 83–198.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.