Michal Kunc Undecidability of the trace coding problem and some decidable cases. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:310, n:1-3, pp:393-456 [Journal]

Michal Kunc Regular solutions of language inequalities and well quasi-orders. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:348, n:2-3, pp:277-293 [Journal]

Michal Kunc What Do We Know About Language Equations? [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2007, pp:23-27 [Conf]

Michal Kunc The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. [Citation Graph (0, 0)][DBLP] FCT, 2007, pp:365-375 [Conf]

Michal Kunc The Power of Commuting with Finite Sets of Words. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2007, v:40, n:4, pp:521-551 [Journal]

Search in 0.014secs, Finished in 0.015secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP