Imre Simon

Imre Simon (born August 14, 1943 in Budapest , † August 13, 2009 in São Paulo ) was a Brazilian computer scientist and mathematician.

Simon came to Brazil with his parents after the Hungarian uprising in 1957. He studied electrical engineering in Sao Paulo (with Tomasz Kowaltowski) and received his diploma in 1970 and his doctorate in 1972 at the University of Waterloo with Janusz Brozozowski (Hierarchies of Events with Dot-Depth One). From 1984 he was a professor at the University of São Paulo , where he retired in 2002. From 1994 to 1998 he was President of the Central Committee for Computer Science at the University of Sao Paulo.

Simon made contributions to automata theory and is considered a pioneer of theoretical computer science in Brazil and the founder of tropical geometry (a term that has its origins in Simon's Brazilian origins). He improved the Knuth-Morris-Pratt algorithm , created an effective characterization of locally testable languages, and introduced nondeterministic complexity of automata and factorization forests. The Simon congruence is named after him (between words with the same partial words up to length n). Simon was a free software advocate.

In 2006 he won the Brazilian Society of Computer Science's Prize for Scientific Merit, in 1979 the Jabuti Prize for Exact Sciences and in 1989 the Science Prize of the Union des Assurances de Paris (UAP) with Michail Leonidowitsch Gromow and Joseph Stiglitz . He was a member of the Brazilian Academy of Sciences and received the Grand Cross of the Ordem Nacional do Mérito Científico. Simon was also president of the Brazilian Mathematical Society.

Fonts

with Cláudio L. Lucchesi, Istvan Simon, Janos Simon, Tomasz Kowaltowski: Aspectos Teóricos da Computação, Projeto Euclides, IMPA, 1979.
On the time required by the Davis-Putnam tautology recognition algorithm., Notices Amer. Math. Soc., Vol. 18, 1971, p. 970.
with Janusz A. Brzozowski: Characterizations of locally testable events, Discrete Mathematics, Volume 4, 1973, pp. 243-271
Limited subsets of a free monoid, in: Proceedings of the 19th Annual Symposium on Foundations of Computer Science, IEEE, 1978
Recognizable sets with multiplicities in the tropical semiring, in: MP Chytil, L. Janiga, V. Koubek (ed.), Mathematical Foundations of Computer Science, Karlsbad 1988, Lecture Notes in Computer Science 324, Springer Verlag, pp. 107-120 .
Properties of factorization forests, in: Jean-Eric Pin (Ed.), Formal Properties of Finite Automata and Applications, Springer-Verlag, Lecture Notes in Computer Science, 386, 1989, pp. 65-72.
The nondeterministic complexity of a finite automaton, in: M. Lothaire (Ed.), Mots - mélanges offerts à MP Schützenberger, Hermes, Paris, 1990, pp. 384-400.
String matching algorithms and automata, in: H. Maurer J. Karhumäki, G. Rozenberg (Ed.), Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Lecture Notes in Computer Science 812, Springer Verlag 1994, p 386-395.

Web links

Individual evidence

↑ Imre Simon in the Mathematics Genealogy Project (English)

personal data
SURNAME	Simon, Imre
BRIEF DESCRIPTION	Brazilian computer scientist and mathematician
DATE OF BIRTH	August 14, 1943
PLACE OF BIRTH	Budapest
DATE OF DEATH	August 13, 2009
Place of death	São Paulo

[1] Imre Simon in the Mathematics Genealogy Project (English)