The following pages link to Ondřej Klíma (Q444672):
Displayed 50 items.
- Identity checking problem for transformation monoids (Q444673) (← links)
- Piecewise testable languages via combinatorics on words (Q641179) (← links)
- Geometrically closed positive varieties of star-free languages (Q782590) (← links)
- (Q870449) (redirect page) (← links)
- Dichotomies in the complexity of solving systems of equations over finite semigroups (Q870451) (← links)
- On the irreducibility of pseudovarieties of semigroups. (Q898188) (← links)
- On varieties of meet automata (Q955003) (← links)
- A counterexample to a conjecture concerning concatenation hierarchies (Q990089) (← links)
- Towards a pseudoequational proof theory (Q1729826) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Geometrically closed positive varieties of languages (Q2084767) (← links)
- Well quasi-orders arising from finite ordered semigroups (Q2163999) (← links)
- On varieties of ordered automata (Q2278266) (← links)
- Deterministic biautomata and subclasses of deterministic linear languages (Q2278286) (← links)
- Syntactic structures of regular languages (Q2333830) (← links)
- Pseudovarieties of ordered completely regular semigroups (Q2422183) (← links)
- Correction to: ``Pseudovarieties of ordered completely regular semigroups'' (Q2422206) (← links)
- Complexity issues of checking identities in finite monoids (Q2655464) (← links)
- Obituary: Libor Polák (1950--2020) (Q2663112) (← links)
- On linear languages recognized by deterministic biautomata (Q2672654) (← links)
- What makes a Stone topological algebra profinite (Q2682630) (← links)
- Rewriting in Varieties of Idempotent Semigroups (Q3014940) (← links)
- LITERALLY IDEMPOTENT LANGUAGES AND THEIR VARIETIES — TWO LETTER CASE (Q3056278) (← links)
- Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups (Q3098040) (← links)
- SUBHIERARCHIES OF THE SECOND LEVEL IN THE STRAUBING–THÉRIEN HIERARCHY (Q3112586) (← links)
- Biautomata for k-Piecewise Testable Languages (Q3167508) (← links)
- Descriptional Complexity of Biautomata (Q3167582) (← links)
- On Decidability of Intermediate Levels of Concatenation Hierarchies (Q3451089) (← links)
- On Varieties of Literally Idempotent Languages (Q3526418) (← links)
- Hierarchies of Piecewise Testable Languages (Q3533034) (← links)
- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups (Q3540122) (← links)
- On Schützenberger Products of Semirings (Q3584900) (← links)
- HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES (Q3586402) (← links)
- Polynomial Operators on Classes of Regular Languages (Q3642537) (← links)
- (Q4496248) (← links)
- (Q4510922) (← links)
- (Q4536381) (← links)
- On biautomata (Q4649457) (← links)
- (Q4964018) (← links)
- (Q4988163) (← links)
- (Q4994934) (← links)
- Binary patterns in the Prouhet-Thue-Morse sequence (Q5024669) (← links)
- Representations of relatively free profinite semigroups, irreducibility, and order primitivity (Q5217888) (← links)
- On fixed points of the lower set operator (Q5246510) (← links)
- Reducibility vs. definability for pseudovarieties of semigroups (Q5298324) (← links)
- Alternative Automata Characterization of Piecewise Testable Languages (Q5300848) (← links)
- On the insertion of n-powers (Q5377227) (← links)
- (Q5414547) (← links)
- Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture (Q5756693) (← links)
- Stone pseudovarieties (Q6326806) (← links)