Ondrej Klíma

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