 | 2011 |
|---|
| 23 |       | 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: 214-227 |
| 22 | | Ondrej Klíma,
Miroslav Korbelár,
Libor Polák:
Rewriting in Varieties of Idempotent Semigroups.
CAI 2011: 185-200 |
| 21 |  | Ondrej Klíma,
Libor Polák:
On Biautomata.
NCMA 2011: 153-164 |
| 20 | | Ondrej Klíma:
Piecewise testable languages via combinatorics on words.
Discrete Mathematics 311(20): 2124-2127 (2011) |
| 19 | | Ondrej Klíma,
Libor Polák:
Subhierarchies of the Second Level in the Straubing-THéRien Hierarchy.
IJAC 21(7): 1195-1215 (2011) |
| 2010 |
|---|
| 18 | | Ondrej Klíma,
Libor Polák:
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
DCFS 2010: 130-138 |
| 17 | | Ondrej Klíma,
Libor Polák:
On Schützenberger Products of Semirings.
Developments in Language Theory 2010: 279-290 |
| 16 | | Jorge Almeida,
Ondrej 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 12(4): 41-58 (2010) |
| 15 | | Ondrej Klíma,
Libor Polák:
Hierarchies of Piecewise Testable Languages.
Int. J. Found. Comput. Sci. 21(4): 517-533 (2010) |
| 14 | | Ondrej Klíma,
Libor Polák:
Literally Idempotent Languages and their Varieties - Two Letter Case.
Int. J. Found. Comput. Sci. 21(5): 761-780 (2010) |
| 2009 |
|---|
| 13 | | Ondrej Klíma,
Libor Polák:
Polynomial Operators on Classes of Regular Languages.
CAI 2009: 260-277 |
| 12 | | Jorge Almeida,
Ondrej Klíma:
A counterexample to a conjecture concerning concatenation hierarchies.
Inf. Process. Lett. 110(1): 4-7 (2009) |
| 2008 |
|---|
| 11 | | Ondrej Klíma,
Libor Polák:
Literally idempotent languages and their varieties - two letter case.
AFL 2008: 220-231 |
| 10 | | Ondrej Klíma,
Libor Polák:
Hierarchies of Piecewise Testable Languages.
Developments in Language Theory 2008: 479-490 |
| 9 | | Ondrej Klíma,
Libor Polák:
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups.
LATA 2008: 299-310 |
| 8 | | Ondrej Klíma,
Libor Polák:
On Varieties of Literally Idempotent Languages.
ITA 42(3): 583-598 (2008) |
| 7 | | Ondrej Klíma,
Libor Polák:
On varieties of meet automata.
Theor. Comput. Sci. 407(1-3): 278-289 (2008) |
| 2007 |
|---|
| 6 | | 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): 263-297 (2007) |
| 2006 |
|---|
| 5 | | Ondrej Klíma,
Benoit Larose,
Pascal Tesson:
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.
MFCS 2006: 584-595 |
| 2004 |
|---|
| 4 | | Ondrej Klíma,
Pascal Tesson,
Denis Thérien:
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups
Electronic Colloquium on Computational Complexity (ECCC)(091): (2004) |
| 2002 |
|---|
| 3 | | Ondrej Klíma:
Unification Modulo Associativity and Idempotency Is NP-complete.
MFCS 2002: 423-432 |
| 2000 |
|---|
| 2 | | Ondrej Klíma,
Jirí Srba:
Matching Modulo Associativity and Idempotency Is NP-Complete.
MFCS 2000: 456-466 |
| 1999 |
|---|
| 1 | | Ivana Cerná,
Ondrej Klíma,
Jirí Srba:
Pattern Equations and Equations with Stuttering.
SOFSEM 1999: 369-378 |
Data released under the ODC-BY 1.0 license — See also our legal information page