The Trace Coding Problem Is Undecidable. - Michal Kunc (ICALP, 2001)

Equational description of pseudovarieties of homomorphisms. - Michal Kunc (RAIRO Theor. Informatics Appl., 2003)

Undecidability of the trace coding problem and some decidable cases. - Michal Kunc (Theor. Comput. Sci., 2004)

On Language Inequalities XK subset of LX. - Michal Kunc (Developments in Language Theory, 2005)

Simple language Equations. - Michal Kunc (Bull. EATCS, 2005)

Regular solutions of language inequalities and well quasi-orders. - Michal Kunc (Theor. Comput. Sci., 2005)

Communication of Two Stacks and Rewriting. - Juhani Karhumäki; Michal Kunc; Alexander Okhotin (ICALP (2), 2006)

Algebraic Characterization of the Finite Power Property. - Michal Kunc (ICALP (1), 2006)

Computing by commuting. - Juhani Karhumäki; Michal Kunc; Alexander Okhotin (Theor. Comput. Sci., 2006)

What Do We Know About Language Equations? - Michal Kunc (Developments in Language Theory, 2007)

The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. - Michal Kunc (FCT, 2007)

The Power of Commuting with Finite Sets of Words. - Michal Kunc (Theory Comput. Syst., 2007)

Computational power of two stacks with restricted communication. - Juhani Karhumäki; Michal Kunc; Alexander Okhotin (Inf. Comput., 2010)

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. - Michal Kunc; Alexander Okhotin (DCFS, 2011)

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. - Michal Kunc; Alexander Okhotin (Developments in Language Theory, 2011)

State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. - Michal Kunc; Alexander Okhotin (Fundam. Informaticae, 2011)

State complexity of operations on two-way finite automata over a unary alphabet. - Michal Kunc; Alexander Okhotin (Theor. Comput. Sci., 2012)

On Decidability of Intermediate Levels of Concatenation Hierarchies. - Jorge Almeida 001; Jana Bartonová; Ondrej Klíma 001; Michal Kunc (DLT, 2015)

The omega-inequality problem for concatenation hierarchies of star-free languages. - Jorge Almeida 001; Ondrej Klíma 001; Michal Kunc (CoRR, 2016)

The Generalized Rank of Trace Languages. - Michal Kunc; Jan Meitner (Int. J. Found. Comput. Sci., 2019)

Reversibility of computations in graph-walking automata. - Michal Kunc; Alexander Okhotin (Inf. Comput., 2020)

Language equations. - Michal Kunc; Alexander Okhotin (Handbook of Automata Theory (I.), 2021)