Imre Simon : an exceptional graduate student

Denis Thérien

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2005)

  • Volume: 39, Issue: 1, page 297-304
  • ISSN: 0988-3754

Abstract

top
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!

How to cite

top

Thérien, Denis. "Imre Simon : an exceptional graduate student." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 39.1 (2005): 297-304. <http://eudml.org/doc/245035>.

@article{Thérien2005,
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 - Informatique Théorique et Applications},
keywords = {algebraic theory of automata; piece-wise testable languages; dot-depth hierarchy},
language = {eng},
number = {1},
pages = {297-304},
publisher = {EDP-Sciences},
title = {Imre Simon : an exceptional graduate student},
url = {http://eudml.org/doc/245035},
volume = {39},
year = {2005},
}

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
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/245035
ER -

References

top
  1. [1] R.S. Cohen and J.A. Brzozowski, Dot-depth of star-free events. J. Comput. Syst. Sci. 5 (1971) 1–15. Zbl0217.29602
  2. [2] S. Eilenberg, Automata, Languages and Machines, Vol. B. Academic Press, New York (1976). Zbl0359.94067MR530383
  3. [3] R. Knast, A semigroup characterisation of dot-depth one languages. RAIRO Inform. Théor. 17 (1984) 321–330. Zbl0522.68063
  4. [4] R. McNaughton and S. Papert, Counter-free automata. MIT Press, Cambridge, Massachussetts (1971). Zbl0232.94024MR371538
  5. [5] J.E. Pin, Varieties of Formal Languages. Plenum, London (1986). Zbl0632.68069MR912694
  6. [6] J.E. Pin, Polynomial closure of group languages and open sets of the hall topology. Theor. Comput. Sci. 169 (1996) 185–200. Zbl0877.68076
  7. [7] J.E. Pin and P. Weil, Polynomial closure and unambiguous product. Theor. Comput. Syst. 30 (1997) 1–39. Zbl0872.68119
  8. [8] M. Schützenberger, On finite monoids having only trivial subgroups. Inform. Control 8 (1965) 190–194. Zbl0131.02001
  9. [9] I. Simon, Hierarchies of events with dot-depth one. Ph.D. thesis, University of Waterloo (1972). 
  10. [10] H. Straubing, Finite semigroup varieties of the form . J. Pure Appl. Algebra 36 (1985) 53–94. Zbl0561.20042
  11. [11] H. Straubing and D. Thérien, Partially ordered finite monoids and a theorem of I. Simon. J. Algebra 119 (1988) 393–399. Zbl0658.20035
  12. [12] D. Thérien, Classification of finite monoids: The language approach. Theor. Comput. Sci. 14 (1981) 195–208. Zbl0471.20055
  13. [13] D. Thérien and A. Weiss, Graph congruences and wreath products. J. Pure Appl. Algebra 36 (1985) 205–212. Zbl0559.20042
  14. [14] B. Tilson, Categories as algebra: An essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48 (1987) 83–198. Zbl0627.20031

NotesEmbed ?

top

You must be logged in to post comments.