doc. Mgr. Ondřej Klíma, Ph.D.

2007

• Hierarchies of piecewise testable languages

  KLÍMA Ondřej POLÁK Libor

  Appeared in Conference without Proceedings

  Year: 2007, type: Appeared in Conference without Proceedings

• Splitting conditions for classes of meet automata

  KLÍMA Ondřej POLÁK Libor

  Article in Proceedings

  Proceedings AutoMathA 2007, June 18-22, 2007, Palermo, Italy (CD), year: 2007

2006

• On varieties of literally idempotent languages

  KLÍMA Ondřej POLÁK Libor

  Article in Proceedings

  Internal Proceedings, Mons Days of Theoretical Computer Science, year: 2006

• Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture

  KLÍMA Ondřej LAROSE Benoit TESSON Pascal

  Article in Proceedings

  Mathematical Foundations of Computer Science, year: 2006

2002

• Unification Modulo Associativity and Idempotency Is NP-complete

  KLÍMA Ondřej

  Article in Proceedings

  Mathematical Foundations of Computer Science 2002:27th International Symposium, year: 2002

2000

• Matching Modulo Associativity and Idempotency is NP-Complete

  KLÍMA Ondřej SRBA Jiří

  Article in Proceedings

  Mathematical Foundation of Computer Science 2000, 25th International Symposium, year: 2000

• On the solvability of equations in semigroups with $x^r=x$

  KLÍMA Ondřej

  Article in Proceedings

  Proceedings of 58th Workshop on General Algebra "58. Arbeitstagung Allgemeine Algebra", year: 2000

1999

• Complexity Issues of the Pattern Equations in Idempotent Semigroups

  KLÍMA Ondřej SRBA Jiří

  Article in Periodical

  Technical Report, Faculty of Informatics, Masaryk University, year: 1999, volume: 1999, edition: 02

• On the Pattern Equations

  ČERNÁ Ivana KLÍMA Ondřej SRBA Jiří

  Article in Periodical

  Technical Report, Faculty of Informatics, Masaryk University, year: 1999, volume: 1999, edition: 01

• Pattern Equations and Equations with Stuttering

  ČERNÁ Ivana SRBA Jiří KLÍMA Ondřej

  Article in Proceedings

  SOFSEM'99: Theory and Practise of Informatics, year: 1999