Format for Printing from Your Browser, MS-Word, LaTeX, rich LaTeX

Curriculum vitae

Person Identification
  • Mgr. Ondřej Klíma, Ph.D.
    born in 1974 in Brno
    married, 3 children
Workplace
  • Faculty of Science
    Department of Mathematics and Statistics
    Janáčkovo nám. 2a
    662 95 Brno
    Czech Republic
Employment Position
  • Associate professor
Education and Academic Qualifications
  • 2013: Doc., MU Brno; theses: "Classifications of regular languages by equational properties of finite semigroups"
  • 2004: Ph.D. in Algebra; MU Brno; theses: "Unification Modulo Associativity and Idempotency"(supervisor: L. Polák)
  • 1998: Mgr. in Mathematics; MU Brno; theses: "Universal words in groups and semigroups"(supervisor: L. Polák)
Employment Summary
  • 2013-...: Faculty of Science MU, associate professor
  • 2004-2013: Faculty of Science MU, assistant professor
  • 2001-2004: Faculty of Science MU, specialist
Pedagogical Activities
  • Foundations of Mathematics, Algebra, Practising Linear Algebra, Practising Set Theory
Scientific and Research Activities
  • The main area of my interest is semigroup theory and its applications to theoretical computer science, in particular: pseudovarieties, combinatorics on words, unification, automata, formal languages.
Academical Stays
  • 2007-2017 - Universidade do Porto numerous research stays
  • 2005 - Quebec University (two weeks) - research stay
  • 2003 - Universitat Tubingen (one week) - research stay
  • 2003 - University of Turku (one week) - study stay
  • 2002 - McGill University (two weeks) - research stay
  • 2001 - TU Darmstadt (three months) - study stay(Socrates/Erasmus)
  • 2000 - Universidade do Porto (three months) - study stay
  • 1999 - TU Dresden (one week) - study stay
Extrauniversity Activities
  • Member of the Brno Region Committee for Mathematical Olympiad
Appreciation of Science Community
  • 2003: Awarded the annual rector's prize, Masaryk University
  • 1998: Awarded the annual dean's prize, Faculty of Science, Masaryk University
Selected Publications
  • KLÍMA, Ondřej and Peter KOSTOLÁNYI. Geometrically Closed Positive Varieties of Star-Free Languages. In Alberto Leporati et al. LATA 2020. Cham: Springer, 2020, p. 328-340. ISBN 978-3-030-40607-3. Available from: https://dx.doi.org/10.1007/978-3-030-40608-0_23. URL info
  • ALMEIDA, Jorge and Ondřej KLÍMA. Representations of relatively free profinite semigroups, irreducibility, and order primitivity. Transactions of the American Mathematical Society. Providence: American Mathematical Society, 2020, vol. 373, No 3, p. 1941-1981. ISSN 0002-9947. Available from: https://dx.doi.org/10.1090/tran/7951. URL info
  • KLÍMA, Ondřej and Libor POLÁK. Forbidden patterns for ordered automata. Journal of Automata, Languages and Combinatorics. Institut fur Informatik, Justus-Liebig-Universitat Giessen, 2020, vol. 25, 2-3, p. 141-169. ISSN 1430-189X. Available from: https://dx.doi.org/10.25596/jalc-2020-141. URL info
  • ALMEIDA, Jorge, Ondřej KLÍMA and Michal KUNC. The omega-inequality problem for concatenation hierarchies of star-free languages. Forum Mathematicum. 2018, vol. 30, No 3, p. 663-679. ISSN 0933-7741. Available from: https://dx.doi.org/10.1515/forum-2016-0028. URL info
  • ALMEIDA, Jorge and Ondřej KLÍMA. Towards a pseudoequational proof theory. Portugaliae mathematica. Lisboa, 2018, vol. 75, No 2, p. 79-119. ISSN 0032-5155. Available from: https://dx.doi.org/10.4171/PM/2012. URL info
  • MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel and Ondřej KLÍMA. On the irreducibility of pseudovarieties of semigroups. Journal of Pure and Applied Algebra. AMSTERDAM: North Holland, 2016, vol. 220, No 4, p. 1517-1524. ISSN 0022-4049. Available from: https://dx.doi.org/10.1016/j.jpaa.2015.09.015. URL info
  • MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel and Ondřej KLÍMA. Reducibility vs. definability for pseudovarieties of semigroups. International Journal of Algebra and Computation. 2016, vol. 26, No 7, p. 1483-1495. ISSN 0218-1967. Available from: https://dx.doi.org/10.1142/S0218196716500648. info
  • ALMEIDA, Jorge, Antonio CANO, Ondřej KLÍMA and Jean-Eric PIN. On fixed points of the lower set operator. International Journal of Algebra and Computation. SINGAPORE: WORLD SCIENTIFIC PUBL CO PTE LTD, 2015, vol. 25, 1-2, p. 259-292. ISSN 0218-1967. Available from: https://dx.doi.org/10.1142/S021819671540010X. info
  • KLÍMA, Ondřej. On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract). Online. In Zoltán Ésik, Zoltán Fülöp. Proceedings AFL 2014. Szeged: EPTCS, 2014, p. 49-54. ISSN 2075-2180. Available from: https://dx.doi.org/10.4204/EPTCS.151.3. URL info
  • KLÍMA, Ondřej and Libor POLÁK. Alternative Automata Characterization of Piecewise Testable Languages. In Marie-Pierre Béal, Olivier Carton. Developments in Language Theory. Berlin Heidelberg: Springer-Verlag, 2013, p. 289-300. ISBN 978-3-642-38770-8. Available from: https://dx.doi.org/10.1007/978-3-642-38771-5_26. info
  • KLÍMA, Ondřej. Identity checking problem for transformation monoids. Semigroup Forum. Springer-Verlag, 2012, vol. 84, No 3, p. 487-498. ISSN 0037-1912. Available from: https://dx.doi.org/10.1007/s00233-012-9401-7. info
  • KLÍMA, Ondřej and Libor POLÁK. On Biautomata. RAIRO - Theoretical Informatics and Applications. Francie, 2012, vol. 46, No 4, p. 573-592. ISSN 0988-3754. Available from: https://dx.doi.org/10.1051/ita/2012014. info
  • JIRÁSKOVÁ, Galina and Ondřej KLÍMA. Descriptional Complexity of Biautomata. In Martin Kutrib, Nelma Moreira, Rogério Reis. Descriptional Complexity of Formal Systems. Berlin Heidelberg: Springer-Verlag Berlin Heidelberg, 2012, p. 196-208. ISBN 978-3-642-31622-7. Available from: https://dx.doi.org/10.1007/978-3-642-31623-4_15. info
  • KLÍMA, Ondřej and Libor POLÁK. Biautomata for k-Piecewise Testable Languages. In Hsu-Chun Yen, Oscar H. Ibarra. Developments in Language Theory. Berlin Heidelberg: Springer - Verlag, 2012, p. 344-355. ISBN 978-3-642-31652-4. Available from: https://dx.doi.org/10.1007/978-3-642-31653-1_31. info
  • KLÍMA, Ondřej. Piecewise Testable Languages via Combinatorics on Words. Discrete Mathematics. 2011, vol. 311, No 20, p. 2124-2127. ISSN 0012-365X. Available from: https://dx.doi.org/10.1016/j.disc.2011.06.013. info
  • KLÍMA, Ondřej, Miroslav KORBELÁŘ and Libor POLÁK. Rewriting in Varieties of Idempotent Semigroups. In Franz Winkler. Algebraic Informatics. Berlin: Springer, 2011, p. 185-200. ISBN 978-3-642-21492-9. Available from: https://dx.doi.org/10.1007/978-3-642-21493-6_12. info
  • KLÍMA, Ondřej and Libor POLÁK. Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups. In Werner Kuich, George Rahonis. Algebraic Foundations in Computer Science. Berlin: Springer, 2011, p. 214-227. ISBN 978-3-642-24896-2. Available from: https://dx.doi.org/10.1007/978-3-642-24897-9_10. info
  • KLÍMA, Ondřej and Libor POLÁK. On Biautomata. In Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano. Non-Classical Models for Automata and Applications. Austrian Computer Society, 2011, p. 153-164. ISBN 978-3-85403-282-3. info
  • KLÍMA, Ondřej and Libor POLÁK. Subhierarchies of the Second Level in the Straubing-Thrien Hierarchy. International Journal of Algebra and Computation. 2011, vol. 21, No 7, p. 1195-1215. ISSN 0218-1967. Available from: https://dx.doi.org/10.1142/S021819671100690X. info
  • KLÍMA, Ondřej and Libor POLÁK. On Schützenberger products of semirings. In Gao, Y; Lu, H; Seki, S; Yu, S. Developments in Language Theory. Berlin Heidelberg (Germany): Springer-Verlag, 2010, p. 279-290. ISBN 978-3-642-14454-7. info
  • KLÍMA, Ondřej and Jorge ALMEIDA. A counterexample to a conjecture concerning concatenation hierarchies. Information Processing Letters. Elsevier, 2009, vol. 110, No 1, p. 4 - 7. ISSN 0020-0190. info
  • KLÍMA, Ondřej. Complexity issues of checking identities in finite monoids. Semigroup Forum. Springer-Verlag, 2009, vol. 79, No 3, p. 435-444. ISSN 0037-1912. info
  • KLÍMA, Ondřej and Libor POLÁK. Polynomial Operators on Classes of Regular Languages. In Algebraic Informatics. Berlin Heidelberg (Germany): Springer-Verlag, 2009, p. 260-277. ISBN 978-3-642-03563-0. info
  • KLÍMA, Ondřej. Piecewise Testable Languages via Combinatorics on Words. In Proceedings WORDS 2009. 2009, 6 pp. URL info
  • KLÍMA, Ondřej and Libor POLÁK. Literal varieties of languages induced by homomorphisms onto nilpotent groups. In Language and Automata Theory and Applications. Berlin Heidelberg (Germany): Springer-Verlag, 2008, p. 299-310. ISBN 978-3-540-88281-7. info
  • KLÍMA, Ondřej and Libor POLÁK. Literally idempotent languages and their varieties - two letter case. In Automata and Formal Languages. Budapest: Computer and Automation research Institute, Hungarian Academy of Science, 2008, p. 220-231, 11 pp. ISBN 978-963-311-367-7. info
  • KLÍMA, Ondřej and Libor POLÁK. On varieties of literally idempotent languages. RAIRO - Theoretical Informatics and Applications. Francie, 2008, vol. 42, No 3, p. 583-598. ISSN 0988-3754. info
  • KLÍMA, Ondřej and Libor POLÁK. On varieties of meet automata. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, 2008, vol. 407, 1-3, p. 278-289. ISSN 0304-3975. info
  • KLÍMA, Ondřej and Libor POLÁK. Hierarchies of piecewise testable languages. In Developments in Language Theory. Berlin Heidelberg (Germany): Springer-Verlag, 2008, p. 479-490. ISBN 978-3-540-85779-2. info
  • KLÍMA, Ondřej, Denis THERIEN and Pascal TESSON. Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. Theory of Computing Systems. New York: Springer, 2007, vol. 40, No 3, p. 263-297. ISSN 1432-4350. URL info
  • KLÍMA, Ondřej and Libor POLÁK. Splitting conditions for classes of meet automata. In Proceedings AutoMathA 2007, June 18-22, 2007, Palermo, Italy (CD). Palermo, Italy: University Palermo, 2007, p. 1-12. info
  • KLÍMA, Ondřej, Benoit LAROSE and Pascal TESSON. Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. In Mathematical Foundations of Computer Science. Berlin: Springer Verlag, 2006, p. 584-595. ISBN 978-3-540-37791-7. info
  • KLÍMA, Ondřej. Unification Modulo Associativity and Idempotency Is NP-complete. In Mathematical Foundations of Computer Science 2002:27th International Symposium. Berlin: Springer-Verlag, 2002, p. 423-432. Lecture Notes in Computer Science, 2420. ISBN 3-540-44040-2. info
  • KLÍMA, Ondřej and Jiří SRBA. Matching Modulo Associativity and Idempotency is NP-Complete. In Mathematical Foundation of Computer Science 2000, 25th International Symposium. Berlin: Springer-Verlag, 2000, p. 456-466. Lecture Notes in Computer Science, 1893. ISBN 3-540-67901-4. info
  • KLÍMA, Ondřej. On the solvability of equations in semigroups with $x^r=x$. In Proceedings of 58th Workshop on General Algebra "58. Arbeitstagung Allgemeine Algebra". Klagenfurt: Verlag Johannes Heyn, 2000, p. 237-246. Contributions to General Algebra 12. ISBN 3-85366-951-4. info
  • ČERNÁ, Ivana, Jiří SRBA and Ondřej KLÍMA. Pattern Equations and Equations with Stuttering. In SOFSEM'99: Theory and Practise of Informatics. Heidelberg: Springer, 1999, p. 369-378. ISBN 3-540-66694-X. info

2017/07/13

Curriculum vitae: doc. Mgr. Ondřej Klíma, Ph.D. (učo 3868), version: English(1), last update: 2017/07/13 11:17, O. Klíma

Another Variant: Czech(1)