Výpis publikací

KUNC, Michal. The power of commuting with finite sets of words. Theory of Computing Systems. New York: Springer, 2007, roč. 40, č. 4, s. 521-551. ISSN 1432-4350.

KUNC, Michal. The simplest language where equivalence of finite substitutions is undecidable. In Fundamentals of Computation Theory: 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007. Proceedings. Berlin: Springer, 2007, s. 365-375. ISBN 978-3-540-74239-5.

KUNC, Michal. What do we know about language equations? In Developments in Language Theory: 11th International Conference, DLT 2007, Turku, Finland, July 2007, Proceedings. Berlin: Springer, 2007, s. 23-27. ISBN 978-3-540-73207-5.

KUNC, Michal. Algebraic characterization of the finite power property. In Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I. Berlin: Springer, 2006, s. 120-131. ISBN 3-540-35904-4.

KARHUMÄKI, Juhani; Michal KUNC a Alexander OKHOTIN. Communication of two stacks and rewriting. In Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II. Berlin: Springer, 2006, s. 468-479. ISBN 3-540-35907-9.

KUNC, Michal. Largest solutions of left-linear language inequalities. In Automata and Formal Languages: 11th International Conference, AFL 2005, Dobogókő, Hungary, May 17-20. Proceedings. Győr: Institute of Informatics, University of Szeged, 2005, s. 178-186.

KUNC, Michal. On language inequalities XK ⊆ LX. In Developments in Language Theory: 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005. Proceedings. Berlin: Springer-Verlag, 2005, s. 327-337. ISBN 3-540-26546-5.

KUNC, Michal. Regular solutions of language inequalities and well quasi-orders. Theoretical Computer Science. Amsterdam: Elsevier, 2005, roč. 348, 2-3, s. 277-293. ISSN 0304-3975.

KUNC, Michal. Simple language equations. Bulletin of the European Association for Theoretical Computer Science EATCS. 2005, roč. 85, February, s. 81-102. ISSN 0252-9742.

KUNC, Michal. The power of commuting with finite sets of words. In STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005. Proceedings. Berlin: Springer-Verlag, 2005, s. 569-580. ISBN 3-540-24998-2.

KUNC, Michal. Regular solutions of language inequalities and well quasi-orders. In Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Heidelberg: Springer-Verlag, 2004, s. 870-881. ISBN 3-540-22849-7.