Jump to content

Róbert Szelepcsényi

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Triangl (talk | contribs) at 11:39, 8 February 2019 (In my previous edit, I didn't notice the word "student". Still past tense is confusing in an opening sentence.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Róbert Szelepcsényi (Slovak pronunciation: [ˈɾɔːbɛɾt ˈsɛlɛptʃɛːɲi]; born 19 August 1966, Žilina[1]) is a Slovak computer scientist of Hungarian descent and a member of the Faculty of Mathematics, Physics and Informatics of Comenius University in Bratislava.

His results on the closure of non-deterministic space under complement, independently obtained in 1987 also by Neil Immerman (the result known as the Immerman–Szelepcsényi theorem), brought the Gödel Prize of ACM and EATCS to both of them in 1995.[2]

Scientific articles

  • Róbert Szelepcsényi: The Method of Forced Enumeration for Nondeterministic Automata. Acta Informatica 26(3): 279-284 (1988)

References

  1. ^ Milan Strhan, David Daniel (eds), Slovakia and the Slovaks – A concise encyclopedia, Encyclopedic Institute of the Slovak Academy of Sciences, 1994.
  2. ^ Gödel Prize citation from ACM