Showing cs.FLShow all
3 papers · 1 filter
cs.FL2017
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…
cs.FL2016
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…
cs.FL2010
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…