Syntactic Semiring of a Language. - Libor Polák (MFCS, 2001)

Syntactic Semiring and Language Equations. - Libor Polák (CIAA, 2002)

Syntactic Semiring and Universal Automaton. - Libor Polák (Developments in Language Theory, 2003)

On Pseudovarieties of Semiring Homomorphisms. - Libor Polák (MFCS, 2004)

Minimalizations of NFA using the universal automaton. - Libor Polák (Int. J. Found. Comput. Sci., 2005)

Small Conjunctive Varieties of Regular Languages. - Libor Polák (Acta Cybern., 2006)

Remarks on Multiple Entry Deterministic Finite Automata. - Libor Polák (J. Autom. Lang. Comb., 2007)

Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. - Ondrej Klíma 001; Libor Polák (LATA, 2008)

On Varieties of Literally Idempotent Languages. - Ondrej Klíma 001; Libor Polák (RAIRO Theor. Informatics Appl., 2008)

On varieties of meet automata. - Ondrej Klíma 001; Libor Polák (Theor. Comput. Sci., 2008)

Polynomial Operators on Classes of Regular Languages. - Ondrej Klíma 001; Libor Polák (CAI, 2009)

On Schützenberger Products of Semirings. - Ondrej Klíma 001; Libor Polák (Developments in Language Theory, 2010)

Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties - Ondrej Klíma 001; Libor Polák (DCFS, 2010)

Hierarchies of Piecewise Testable Languages. - Ondrej Klíma 001; Libor Polák (Int. J. Found. Comput. Sci., 2010)

Literally Idempotent Languages and their Varieties - Two Letter Case. - Ondrej Klíma 001; Libor Polák (Int. J. Found. Comput. Sci., 2010)

Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups. - Ondrej Klíma 001; Libor Polák (Algebraic Foundations in Computer Science, 2011)

Rewriting in Varieties of Idempotent Semigroups. - Ondrej Klíma 001; Miroslav Korbelár; Libor Polák (CAI, 2011)

Subhierarchies of the Second Level in the Straubing-THéRien Hierarchy. - Ondrej Klíma 001; Libor Polák (Int. J. Algebra Comput., 2011)

Biautomata for k-Piecewise Testable Languages. - Ondrej Klíma 001; Libor Polák (Developments in Language Theory, 2012)

On biautomata. - Ondrej Klíma 001; Libor Polák (RAIRO Theor. Informatics Appl., 2012)

Alternative Automata Characterization of Piecewise Testable Languages. - Ondrej Klíma 001; Libor Polák (Developments in Language Theory, 2013)

On Varieties of Ordered Automata. - Ondrej Klíma 001; Libor Polák (LATA, 2019)

Syntactic structures of regular languages. - Ondrej Klíma 001; Libor Polák (Theor. Comput. Sci., 2019)

Forbidden Patterns for Ordered Automata. - Ondrej Klíma 001; Libor Polák (J. Autom. Lang. Comb., 2020)