7 citations · 16 across the 8 of their papers we have counts for
10 papers
What makes a Stone topological algebra profinite
Jorge Almeida, Herman Goulet-Ouellet, Ondřej Klíma
This paper is a contribution to understanding what properties should a topological algebra on a Stone space satisfy to be profinite. We reformulate and simplify proofs for some kno…
Pseudovarieties of ordered completely regular semigroups
Jorge Almeida, Ondřej Klíma
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The questi…
On Varieties of Ordered Automata
Ondřej Klíma, Libor Polák
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more gen…
On the insertion of n-powers
J. Almeida, O. Klíma
In algebraic terms, the insertion of -powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality $1\le x…
Syntactic Structures of Regular Languages
Ondřej Klíma, Libor Polák
We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those thre…
Reducibility versus definability for pseudovarieties of semigroups
J. Almeida, O. Klíma
It is easy to show that a pseudovariety which is reducible with respect to an implicit signature for the equation can also be defined by -identities. We present severa…
The omega-inequality problem for concatenation hierarchies of star-free languages
J. Almeida, O. Klíma, M. Kunc
The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages. The main result shows th…
Representations of relatively free profinite semigroups, irreducibility, and order primitivity
J. Almeida, O. Klíma
We establish that, under certain closure assumptions on a pseudovariety of semigroups, the corresponding relatively free profinite semigroups freely generated by a non-singleton fi…
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
Ondřej Klíma
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this co…
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
Ondřej Klíma, Libor Polák
The first step when forming the polynomial hierarchies of languages is to consider languages of the form KaL where K and L are over a finite alphabet A and from a given variety V o…