Ondrej Klíma

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 17

Top Topics

Regular Languages

Partially Ordered

Binary Patterns

Top Venues

Discret. Math. Theor. Comput. Sci.

Publications

Ondrej Klíma, Jonatan Kolegar
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words. Theory Comput. Syst. 68 (3) (2024)
Galina Jirásková, Ondrej Klíma
On linear languages recognized by deterministic biautomata. Inf. Comput. 286 (2022)
Ondrej Klíma, Peter Kostolányi
Geometrically closed positive varieties of languages. Inf. Comput. 288 (2022)
Jorge Almeida, Ondrej Klíma
Binary patterns in the Prouhet-Thue-Morse sequence. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Ondrej Klíma, Libor Polák
Forbidden Patterns for Ordered Automata. J. Autom. Lang. Comb. 25 (2-3) (2020)
Jorge Almeida, Ondrej Klíma
Profinite congruences and unary algebras. CoRR (2020)
Ondrej Klíma, Peter Kostolányi
Geometrically Closed Positive Varieties of Star-Free Languages. LATA (2020)
Ondrej Klíma, Libor Polák
On Varieties of Ordered Automata. LATA (2019)
Jorge Almeida, Ondrej Klíma
On the insertion of n-powers. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Galina Jirásková, Ondrej Klíma
Deterministic Biautomata and Subclasses of Deterministic Linear Languages. LATA (2019)
Ondrej Klíma, Libor Polák
Syntactic structures of regular languages. Theor. Comput. Sci. 800 (2019)
Ondrej Klíma, Libor Polák
Forbidden patterns for ordered automata. NCMA (2018)
Ondrej Klíma, Libor Polák
On Varieties of Ordered Automata. CoRR (2017)
Jorge Almeida, Ondrej Klíma
On the insertion of n-powers. CoRR (2017)
Ondrej Klíma, Libor Polák
Syntactic Structures of Regular Languages. CoRR (2016)
Jorge Almeida, Ondrej Klíma, Michal Kunc
The omega-inequality problem for concatenation hierarchies of star-free languages. CoRR (2016)
Jorge Almeida, Ondrej Klíma
Reducibility vs. definability for pseudovarieties of semigroups. Int. J. Algebra Comput. 26 (7) (2016)
Jorge Almeida, A. Cano, Ondrej Klíma, Jean-Éric Pin
On fixed points of the lower set operator. Int. J. Algebra Comput. 25 (1-2) (2015)
Jorge Almeida, Jana Bartonová, Ondrej Klíma, Michal Kunc
On Decidability of Intermediate Levels of Concatenation Hierarchies. DLT (2015)
Ondrej Klíma
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract). AFL (2014)
Ondrej Klíma, Libor Polák
Alternative Automata Characterization of Piecewise Testable Languages. Developments in Language Theory (2013)
Galina Jirásková, Ondrej Klíma
Descriptional Complexity of Biautomata. DCFS (2012)
Ondrej Klíma, Libor Polák
On biautomata. RAIRO Theor. Informatics Appl. 46 (4) (2012)
Ondrej Klíma, Libor Polák
Biautomata for k-Piecewise Testable Languages. Developments in Language Theory (2012)
Ondrej Klíma, Libor Polák
Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups. Algebraic Foundations in Computer Science (2011)
Ondrej Klíma, Miroslav Korbelár, Libor Polák
Rewriting in Varieties of Idempotent Semigroups. CAI (2011)
Ondrej Klíma, Libor Polák
Subhierarchies of the Second Level in the Straubing-THéRien Hierarchy. Int. J. Algebra Comput. 21 (7) (2011)
Ondrej Klíma
Piecewise testable languages via combinatorics on words. Discret. Math. 311 (20) (2011)
Ondrej Klíma, Libor Polák
On Biautomata. NCMA (2011)
Ondrej Klíma, Libor Polák
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties DCFS (2010)
Ondrej Klíma, Libor Polák
Literally Idempotent Languages and their Varieties - Two Letter Case. Int. J. Found. Comput. Sci. 21 (5) (2010)
Ondrej Klíma, Libor Polák
On Schützenberger Products of Semirings. Developments in Language Theory (2010)
Ondrej Klíma, Libor Polák
Hierarchies of Piecewise Testable Languages. Int. J. Found. Comput. Sci. 21 (4) (2010)
Jorge Almeida, Ondrej Klíma
New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages. Discret. Math. Theor. Comput. Sci. 12 (4) (2010)
Ondrej Klíma, Libor Polák
Polynomial Operators on Classes of Regular Languages. CAI (2009)
Jorge Almeida, Ondrej Klíma
A counterexample to a conjecture concerning concatenation hierarchies. Inf. Process. Lett. 110 (1) (2009)
Ondrej Klíma, Libor Polák
Hierarchies of Piecewise Testable Languages. Developments in Language Theory (2008)
Ondrej Klíma, Libor Polák
Literally idempotent languages and their varieties - two letter case. AFL (2008)
Ondrej Klíma, Libor Polák
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. LATA (2008)
Ondrej Klíma, Libor Polák
On Varieties of Literally Idempotent Languages. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Ondrej Klíma, Libor Polák
On varieties of meet automata. Theor. Comput. Sci. 407 (1-3) (2008)
Ondrej Klíma, Pascal Tesson, Denis Thérien
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. Theory Comput. Syst. 40 (3) (2007)
Ondrej Klíma, Benoît Larose, Pascal Tesson
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. MFCS (2006)
Ondrej Klíma, Pascal Tesson, Denis Thérien
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups Electron. Colloquium Comput. Complex. (091) (2004)
Ondrej Klíma
Unification Modulo Associativity and Idempotency Is NP-complete. MFCS (2002)
Ondrej Klíma, Jirí Srba
Matching Modulo Associativity and Idempotency Is NP-Complete. MFCS (2000)
Ivana Cerná, Ondrej Klíma, Jirí Srba
Pattern Equations and Equations with Stuttering. SOFSEM (1999)