Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-28T09:59:24.113Z Has data issue: false hasContentIssue false
  • English
  • Français

Imre Simon: an exceptional graduate student

Published online by Cambridge University Press:  15 March 2005

Denis Thérien
Denis Thérien*
Affiliation:
School of Computer Science, McGill University, 3480 University Street, McConnell Engineering Building, Room 318, Montreal, Québec, H3A 2A7 Canada; denis@cs.mcgill.ca
Get access

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!

Keywords

Algebraic theory of automatapiece-wise testable languagesdot-depth hierarchy.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 39 , Issue 1: Imre Simon, the tropical computer scientist , January 2005 , pp. 297 - 304
Copyright
© EDP Sciences, 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Cohen, R.S. and Brzozowski, J.A., Dot-depth of star-free events. J. Comput. Syst. Sci. 5 (1971) 1–15. CrossRef
S. Eilenberg, Automata, Languages and Machines, Vol. B. Academic Press, New York (1976).
Knast, R., A semigroup characterisation of dot-depth one languages. RAIRO Inform. Théor. 17 (1984) 321–330. CrossRef
R. McNaughton and S. Papert, Counter-free automata. MIT Press, Cambridge, Massachussetts (1971).
J.E. Pin, Varieties of Formal Languages. Plenum, London (1986).
Pin, J.E., Polynomial closure of group languages and open sets of the hall topology. Theor. Comput. Sci. 169 (1996) 185–200. CrossRef
Pin, J.E. and Weil, P., Polynomial closure and unambiguous product. Theor. Comput. Syst. 30 (1997) 1–39. CrossRef
Schützenberger, M., On finite monoids having only trivial subgroups. Inform. Control 8 (1965) 190–194. CrossRef
I. Simon, Hierarchies of events with dot-depth one. Ph.D. thesis, University of Waterloo (1972).
Straubing, H., Finite semigroup varieties of the form V ∗ D. J. Pure Appl. Algebra 36 (1985) 53–94. CrossRef
Straubing, H. and Thérien, D., Partially ordered finite monoids and a theorem of I. Simon. J. Algebra 119 (1988) 393–399. CrossRef
Thérien, D., Classification of finite monoids: The language approach. Theor. Comput. Sci. 14 (1981) 195–208. CrossRef
Thérien, D. and Weiss, A., Graph congruences and wreath products. J. Pure Appl. Algebra 36 (1985) 205–212. CrossRef
Tilson, B., Categories as algebra: An essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48 (1987) 83–198. CrossRef