Pattern Equations and Equations with Stuttering. - Ivana Cerná; Ondrej Klíma 001; Jirí Srba (SOFSEM, 1999)

Matching Modulo Associativity and Idempotency Is NP-Complete. - Ondrej Klíma 001; Jirí Srba (MFCS, 2000)

Unification Modulo Associativity and Idempotency Is NP-complete. - Ondrej Klíma 001 (MFCS, 2002)

Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups - Ondrej Klíma 001; Pascal Tesson; Denis Thérien (Electron. Colloquium Comput. Complex., 2004)

Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. - Ondrej Klíma 001; Benoît Larose; Pascal Tesson (MFCS, 2006)

Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. - Ondrej Klíma 001; Libor Polák (LATA, 2008)

On Varieties of Literally Idempotent Languages. - Ondrej Klíma 001; Libor Polák (RAIRO Theor. Informatics Appl., 2008)

On varieties of meet automata. - Ondrej Klíma 001; Libor Polák (Theor. Comput. Sci., 2008)

Polynomial Operators on Classes of Regular Languages. - Ondrej Klíma 001; Libor Polák (CAI, 2009)

A counterexample to a conjecture concerning concatenation hierarchies. - Jorge Almeida 001; Ondrej Klíma 001 (Inf. Process. Lett., 2009)

On Schützenberger Products of Semirings. - Ondrej Klíma 001; Libor Polák (Developments in Language Theory, 2010)

Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties - Ondrej Klíma 001; Libor Polák (DCFS, 2010)

New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages. - Jorge Almeida 001; Ondrej Klíma 001 (Discret. Math. Theor. Comput. Sci., 2010)

Hierarchies of Piecewise Testable Languages. - Ondrej Klíma 001; Libor Polák (Int. J. Found. Comput. Sci., 2010)

Literally Idempotent Languages and their Varieties - Two Letter Case. - Ondrej Klíma 001; Libor Polák (Int. J. Found. Comput. Sci., 2010)

Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups. - Ondrej Klíma 001; Libor Polák (Algebraic Foundations in Computer Science, 2011)

Rewriting in Varieties of Idempotent Semigroups. - Ondrej Klíma 001; Miroslav Korbelár; Libor Polák (CAI, 2011)

Piecewise testable languages via combinatorics on words. - Ondrej Klíma 001 (Discret. Math., 2011)

Subhierarchies of the Second Level in the Straubing-THéRien Hierarchy. - Ondrej Klíma 001; Libor Polák (Int. J. Algebra Comput., 2011)

Descriptional Complexity of Biautomata. - Galina Jirásková; Ondrej Klíma 001 (DCFS, 2012)

Biautomata for k-Piecewise Testable Languages. - Ondrej Klíma 001; Libor Polák (Developments in Language Theory, 2012)

On biautomata. - Ondrej Klíma 001; Libor Polák (RAIRO Theor. Informatics Appl., 2012)

Alternative Automata Characterization of Piecewise Testable Languages. - Ondrej Klíma 001; Libor Polák (Developments in Language Theory, 2013)

On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract). - Ondrej Klíma 001 (AFL, 2014)

On Decidability of Intermediate Levels of Concatenation Hierarchies. - Jorge Almeida 001; Jana Bartonová; Ondrej Klíma 001; Michal Kunc (DLT, 2015)

On fixed points of the lower set operator. - Jorge Almeida 001; Antonio Cano; Ondrej Klíma 001; Jean-Éric Pin (Int. J. Algebra Comput., 2015)

The omega-inequality problem for concatenation hierarchies of star-free languages. - Jorge Almeida 001; Ondrej Klíma 001; Michal Kunc (CoRR, 2016)

Reducibility vs. definability for pseudovarieties of semigroups. - Jorge Almeida 001; Ondrej Klíma 001 (Int. J. Algebra Comput., 2016)

On Varieties of Ordered Automata. - Ondrej Klíma 001; Libor Polák (LATA, 2019)

Deterministic Biautomata and Subclasses of Deterministic Linear Languages. - Galina Jirásková; Ondrej Klíma 001 (LATA, 2019)

On the insertion of n-powers. - Jorge Almeida 001; Ondrej Klíma 001 (Discret. Math. Theor. Comput. Sci., 2019)

Syntactic structures of regular languages. - Ondrej Klíma 001; Libor Polák (Theor. Comput. Sci., 2019)

Geometrically Closed Positive Varieties of Star-Free Languages. - Ondrej Klíma 001; Peter Kostolányi (LATA, 2020)

Profinite congruences and unary algebras. - Jorge Almeida 001; Ondrej Klíma 001 (CoRR, 2020)

Forbidden Patterns for Ordered Automata. - Ondrej Klíma 001; Libor Polák (J. Autom. Lang. Comb., 2020)

Binary patterns in the Prouhet-Thue-Morse sequence. - Jorge Almeida 001; Ondrej Klíma 001 (Discret. Math. Theor. Comput. Sci., 2021)

Well Quasi-Orders Arising from Finite Ordered Semigroups. - Ondrej Klíma 001; Jonatan Kolegar (DLT, 2022)

On linear languages recognized by deterministic biautomata. - Galina Jirásková; Ondrej Klíma 001 (Inf. Comput., 2022)

Geometrically closed positive varieties of languages. - Ondrej Klíma 001; Peter Kostolányi (Inf. Comput., 2022)

Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words. - Ondrej Klíma 001; Jonatan Kolegar (Theory Comput. Syst., 2024)

Eilenberg correspondence for Stone recognition. - Jorge Almeida 001; Ondrej Klíma 001 (CoRR, 2025)