Masarykova univerzita

Výpis publikací

česky | in English

Filtrování publikací

    2020

  1. KLÍMA, Ondřej a Peter KOSTOLÁNYI. Geometrically Closed Positive Varieties of Star-Free Languages. In Alberto Leporati et al.. LATA 2020. Cham: Springer, 2020. s. 328-340, 13 s. ISBN 978-3-030-40607-3. doi:10.1007/978-3-030-40608-0_23.
  2. 2019

  3. JIRÁSKOVÁ, Galina a Ondřej KLÍMA. Deterministic Biautomata and Subclasses of Deterministic Linear Languages. In Carlos Martín-Vide; Alexander Okhotin; Dana Shapira. Language and Automata Theory and Applications. Germany: Springer Verlag, 2019. s. 315-327, 13 s. ISBN 978-3-030-13434-1. doi:10.1007/978-3-030-13435-8_23.
  4. MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel a Ondřej KLÍMA. On the insertion of n-powers. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, NANCY: DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE, 2019, roč. 21, č. 3, s. 1-18. ISSN 1462-7264.
  5. KLÍMA, Ondřej a Libor POLÁK. On Varieties of Ordered Automata. In Carlos Martín-Vide; Alexander Okhotin; Dana Shapira. Language and Automata Theory and Applications. Germany: Springer Verlag, 2019. s. 108-120, 13 s. ISBN 978-3-030-13434-1. doi:10.1007/978-3-030-13435-8_8.
  6. ALMEIDA, Jorge a Ondřej KLÍMA. Pseudovarieties of Ordered Completely Regular Semigroups. RESULTS IN MATHEMATICS, BASEL: SPRINGER BASEL AG, 2019, roč. 74, č. 2, s. 1-28. ISSN 1422-6383. doi:10.1007/s00025-019-0998-7.
  7. ALMEIDA, Jorge a Ondřej KLÍMA. Pseudovarieties of Ordered Completely Regular Semigroups (vol 74, 78, 2019). RESULTS IN MATHEMATICS, BASEL: SPRINGER BASEL AG, 2019, roč. 74, č. 2, s. 1-3. ISSN 1422-6383. doi:10.1007/s00025-019-1014-y.
  8. KLÍMA, Ondřej a Libor POLÁK. Syntactic structures of regular languages. Theoretical Computer Science, AMSTERDAM: North Holland, 2019, roč. 800, DEC 31 2019, s. 125-141. ISSN 0304-3975. doi:10.1016/j.tcs.2019.10.020.
  9. 2018

  10. ALMEIDA, Jorge, Ondřej KLÍMA a Michal KUNC. The omega-inequality problem for concatenation hierarchies of star-free languages. Forum Mathematicum, 2018, roč. 30, č. 3, s. 663-679. ISSN 0933-7741. doi:10.1515/forum-2016-0028.
  11. ALMEIDA, Jorge a Ondřej KLÍMA. Towards a pseudoequational proof theory. Portugaliae mathematica, Lisboa, 2018, roč. 75, č. 2, s. 79-119. ISSN 0032-5155. doi:10.4171/PM/2012.
  12. 2016

  13. MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel a Ondřej KLÍMA. On the irreducibility of pseudovarieties of semigroups. Journal of Pure and Applied Algebra, AMSTERDAM: North Holland, 2016, roč. 220, č. 4, s. 1517-1524. ISSN 0022-4049. doi:10.1016/j.jpaa.2015.09.015.
  14. MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel a Ondřej KLÍMA. Reducibility vs. definability for pseudovarieties of semigroups. International Journal of Algebra and Computation, 2016, roč. 26, č. 7, s. 1483-1495. ISSN 0218-1967. doi:10.1142/S0218196716500648.
  15. 2015

  16. MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel, Jana BARTOŇOVÁ, Ondřej KLÍMA a Michal KUNC. On decidability of intermediate levels of concatenation hierarchies. In Igor Potapov. Developments in Language Theory : 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Berlin: Springer, 2015. s. 58-70, 13 s. ISBN 978-3-319-21499-3. doi:10.1007/978-3-319-21500-6_4.
  17. ALMEIDA, Jorge, Antonio CANO, Ondřej KLÍMA a 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, roč. 25, 1-2, s. 259-292. ISSN 0218-1967. doi:10.1142/S021819671540010X.
  18. 2014

  19. KLÍMA, Ondřej. On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract). In Zoltán Ésik, Zoltán Fülöp. Proceedings AFL 2014. Szeged: EPTCS, 2014. s. 49-54, 6 s. ISSN 2075-2180. doi:10.4204/EPTCS.151.3.
  20. 2013

  21. KLÍMA, Ondřej a 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. s. 289-300, 12 s. ISBN 978-3-642-38770-8. doi:10.1007/978-3-642-38771-5_26.
  22. 2012

  23. KLÍMA, Ondřej a 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. s. 344-355, 12 s. ISBN 978-3-642-31652-4. doi:10.1007/978-3-642-31653-1_31.
  24. JIRÁSKOVÁ, Galina a 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. s. 196-208, 13 s. ISBN 978-3-642-31622-7. doi:10.1007/978-3-642-31623-4_15.
  25. KLÍMA, Ondřej. Identity checking problem for transformation monoids. Semigroup Forum, Springer-Verlag, 2012, roč. 84, č. 3, s. 487-498. ISSN 0037-1912. doi:10.1007/s00233-012-9401-7.
  26. KLÍMA, Ondřej a Libor POLÁK. On Biautomata. RAIRO - Theoretical Informatics and Applications, Francie, 2012, roč. 46, č. 4, s. 573-592. ISSN 0988-3754. doi:10.1051/ita/2012014.
  27. 2011

  28. KLÍMA, Ondřej a 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. s. 214-227, 14 s. ISBN 978-3-642-24896-2. doi:10.1007/978-3-642-24897-9_10.
  29. KLÍMA, Ondřej a 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. s. 153-164, 12 s. ISBN 978-3-85403-282-3.
  30. KLÍMA, Ondřej. Piecewise Testable Languages via Combinatorics on Words. Discrete Mathematics, 2011, roč. 311, č. 20, s. 2124-2127. ISSN 0012-365X. doi:10.1016/j.disc.2011.06.013.
  31. KLÍMA, Ondřej, Miroslav KORBELÁŘ a Libor POLÁK. Rewriting in Varieties of Idempotent Semigroups. In Franz Winkler. Algebraic Informatics. Berlin: Springer, 2011. s. 185-200, 16 s. ISBN 978-3-642-21492-9. doi:10.1007/978-3-642-21493-6_12.
  32. KLÍMA, Ondřej a Libor POLÁK. Subhierarchies of the Second Level in the Straubing-Thrien Hierarchy. International Journal of Algebra and Computation, 2011, roč. 21, č. 7, s. 1195-1215. ISSN 0218-1967. doi:10.1142/S021819671100690X.
  33. 2010

  34. KLÍMA, Ondřej a Libor POLÁK. Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties. In Ian McQuillan; Giovanni Pighizzin. Descriptional Complexity of Formal Systems. 2010. s. 130-138, 9 s. ISSN 2075-2180.
  35. KLÍMA, Ondřej a Libor POLÁK. Hierarchies of piecewise testable languages. International Journal of Foundations of Computer Science, Singapur: World Scientific, 2010, roč. 21, č. 4, s. 517-533. ISSN 0129-0541.
  36. KLÍMA, Ondřej a Libor POLÁK. Literally idempotent languages and their varieties - two letter case. International Journal of Foundations of Computer Science, Singapur: World Scientific, 2010, roč. 21, č. 5, s. 761-780. ISSN 0129-0541.
  37. ALMEIDA, Jorge a Ondřej KLÍMA. New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages. Discrete Mathematics & Theoretical Computer Science, France: DMTCS, 2010, roč. 12, č. 4, s. 41-58. ISSN 1365-8050.
  38. KLÍMA, Ondřej a 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. s. 279-290, 12 s. ISBN 978-3-642-14454-7.
  39. 2009

  40. KLÍMA, Ondřej a Jorge ALMEIDA. A counterexample to a conjecture concerning concatenation hierarchies. Information Processing Letters, Elsevier, 2009, roč. 110, č. 1, s. 4 - 7. ISSN 0020-0190.
  41. KLÍMA, Ondřej. Complexity issues of checking identities in finite monoids. Semigroup Forum, Springer-Verlag, 2009, roč. 79, č. 3, s. 435-444. ISSN 0037-1912.
  42. KLÍMA, Ondřej. Piecewise Testable Languages via Combinatorics on Words. In Proceedings WORDS 2009. 2009. 6 s.
  43. KLÍMA, Ondřej a Libor POLÁK. Polynomial Operators on Classes of Regular Languages. In Algebraic Informatics. Berlin Heidelberg (Germany): Springer-Verlag, 2009. s. 260-277, 18 s. ISBN 978-3-642-03563-0.
  44. 2008

  45. KLÍMA, Ondřej a Libor POLÁK. Hierarchies of piecewise testable languages. In Developments in Language Theory. Berlin Heidelberg (Germany): Springer-Verlag, 2008. s. 479-490, 12 s. ISBN 978-3-540-85779-2.
  46. KLÍMA, Ondřej a 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. s. 299-310, 12 s. ISBN 978-3-540-88281-7.
  47. KLÍMA, Ondřej a 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. s. 220-231, 11 s. ISBN 978-963-311-367-7.
  48. KLÍMA, Ondřej a Libor POLÁK. On varieties of literally idempotent languages. RAIRO - Theoretical Informatics and Applications, Francie, 2008, roč. 42, č. 3, s. 583-598. ISSN 0988-3754.
  49. KLÍMA, Ondřej a Libor POLÁK. On varieties of meet automata. Theoretical Computer Science, Amsterdam, Nizozemí: Elsevier, 2008, roč. 407, 1-3, s. 278-289. ISSN 0304-3975.
  50. 2007

  51. KLÍMA, Ondřej, Denis THERIEN a Pascal TESSON. Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. Theory of Computing Systems, New York: Springer, 2007, roč. 40, č. 3, s. 263-297. ISSN 1432-4350.
  52. KLÍMA, Ondřej a Libor POLÁK. Hierarchies of piecewise testable languages. In 75th Workshop on General Algebra, Darmstadt University of Technology, November 2-4, 2007. 2007.
  53. KLÍMA, Ondřej a 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. s. 1-12, 12 s.
  54. 2006

  55. KLÍMA, Ondřej a Libor POLÁK. On varieties of literally idempotent languages. In Internal Proceedings, Mons Days of Theoretical Computer Science. Rennes: University Rennes, 2006. s. 259-273, 15 s.
  56. KLÍMA, Ondřej, Benoit LAROSE a Pascal TESSON. Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. In Mathematical Foundations of Computer Science. Berlin: Springer Verlag, 2006. s. 584-595, 12 s. ISBN 978-3-540-37791-7.
  57. 2002

  58. 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. s. 423-432. Lecture Notes in Computer Science, 2420. ISBN 3-540-44040-2.
  59. 2000

  60. KLÍMA, Ondřej a Jiří SRBA. Matching Modulo Associativity and Idempotency is NP-Complete. In Mathematical Foundation of Computer Science 2000, 25th International Symposium. Berlin: Springer-Verlag, 2000. s. 456-466. Lecture Notes in Computer Science, 1893. ISBN 3-540-67901-4.
  61. 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. s. 237-246. Contributions to General Algebra 12. ISBN 3-85366-951-4.
  62. 1999

  63. KLÍMA, Ondřej a Jiří SRBA. Complexity Issues of the Pattern Equations in Idempotent Semigroups. Technical Report, Faculty of Informatics, Masaryk University, Brno, 1999, roč. 1999, č. 02, s. 1. ISSN FIMU-RS-99-02.
  64. ČERNÁ, Ivana, Ondřej KLÍMA a Jiří SRBA. On the Pattern Equations. Technical Report, Faculty of Informatics, Masaryk University, Brno, 1999, roč. 1999, č. 01, s. 1. ISSN FIMU-RS-99-01.
  65. ČERNÁ, Ivana, Jiří SRBA a Ondřej KLÍMA. Pattern Equations and Equations with Stuttering. In SOFSEM'99: Theory and Practise of Informatics. Heidelberg: Springer, 1999. s. 369-378. ISBN 3-540-66694-X.
Zobrazit podrobně
Zobrazeno: 12. 7. 2020 21:51