Výpis publikací

KUNC, Michal a Alexander OKHOTIN. Language equations. In Jean-Éric Pin. Handbook of Automata Theory: Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications. Berlin: European Mathematical Society Publishing House, 2021, s. 765-799. ISBN 978-3-98547-006-8. Dostupné z: https://doi.org/10.4171/Automata-1/21.

KUNC, Michal a Alexander OKHOTIN. Reversibility of computations in graph-walking automata. Information and computation. San Diego: Academic Press Inc Elsevier Science, 2020, roč. 275, December 2020, s. 1-32. ISSN 0890-5401. Dostupné z: https://doi.org/10.1016/j.ic.2020.104631.

KUNC, Michal a Jan MEITNER. The generalized rank of trace languages. International Journal of Foundations of Computer Science. Singapore: World Scientific Publishing Co Pte Ltd, 2019, roč. 30, č. 1, s. 135-169. ISSN 0129-0541. Dostupné z: https://doi.org/10.1142/S0129054119400070.

ALMEIDA, Jorge; Ondřej KLÍMA a Michal KUNC. The omega-inequality problem for concatenation hierarchies of star-free languages. Forum Mathematicum. 2018, roč. 30, č. 3, s. 663-679. ISSN 0933-7741. Dostupné z: https://doi.org/10.1515/forum-2016-0028.

KUNC, Michal a Jan MEITNER. The generalized rank of trace languages. In Émilie Charlier, Julien Leroy, Michel Rigo. Developments in Language Theory. 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Cham, Švýcarsko: Springer, 2017, s. 247-259. ISBN 978-3-319-62808-0. Dostupné z: https://doi.org/10.1007/978-3-319-62809-7_18.

MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel; Jana BARTOŇOVÁ; Ondřej KLÍMA a Michal KUNC. On decidability of intermediate levels of concatenation hierarchies. In Igor Potapov. Developments in Language Theory : 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Berlin: Springer, 2015, s. 58-70. ISBN 978-3-319-21499-3. Dostupné z: https://doi.org/10.1007/978-3-319-21500-6_4.

KUNC, Michal a Alexander OKHOTIN. Reversibility of computations in graph-walking automata. In Krishnendu Chatterjee, Jirí Sgall. Mathematical Foundations of Computer Science 2013. Berlin: Springer, 2013, s. 595-606. ISBN 978-3-642-40312-5. Dostupné z: https://doi.org/10.1007/978-3-642-40313-2_53.

KUNC, Michal a Alexander OKHOTIN. State complexity of operations on two-way finite automata over a unary alphabet. Theoretical Computer Science. Amsterdam: Elsevier, 2012, roč. 449, č. 1, s. 106-118. ISSN 0304-3975. Dostupné z: https://doi.org/10.1016/j.tcs.2012.04.010.

KUNC, Michal a Alexander OKHOTIN. Describing periodicity in two-way deterministic finite automata using transformation semigroups. In Giancarlo Mauri, Alberto Leporati. Developments in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings. Berlin: Springer, 2011, s. 324-336. ISBN 978-3-642-22320-4. Dostupné z: https://doi.org/10.1007/978-3-642-22321-1_28.

KUNC, Michal a Alexander OKHOTIN. State complexity of operations on two-way deterministic finite automata over a unary alphabet. In Markus Holzer, Martin Kutrib, Giovanni Pighizzini. Descriptional Complexity of Formal Systems: 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Berlin: Springer, 2011, s. 222-234. ISBN 978-3-642-22599-4. Dostupné z: https://doi.org/10.1007/978-3-642-22600-7_18.

KUNC, Michal a Alexander OKHOTIN. State complexity of union and intersection for two-way nondeterministic finite automata. Fundamenta Informaticae. Amsterdam: IOS Press, 2011, roč. 110, 1-4, s. 231-239. ISSN 0169-2968. Dostupné z: https://doi.org/10.3233/FI-2011-540.

KARHUMÄKI, Juhani; Michal KUNC a Alexander OKHOTIN. Computational power of two stacks with restricted communication. Information and Computation. Amsterdam: Elsevier, 2010, roč. 208, č. 9, s. 1060-1089. ISSN 0890-5401.

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.

KARHUMÄKI, Juhani; Michal KUNC a Alexander OKHOTIN. Computing by commuting. Theoretical Computer Science. Amsterdam: Elsevier, 2006, roč. 356, 1-2, s. 200-211. ISSN 0304-3975.

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.

KUNC, Michal. Undecidability of the trace coding problem and some decidable cases. Theoretical Computer Science. Amsterdam: Elsevier, 2004, roč. 310, 1-3, s. 393-456. ISSN 0304-3975.

KUNC, Michal. Equational description of pseudovarieties of homomorphisms. RAIRO - Theoretical Informatics and Applications. Les Ulis (Francie): EDP Sciences, 2003, roč. 37, č. 3, s. 243-254. ISSN 0988-3754.

KUNC, Michal. The trace coding problem is undecidable (extended abstract). In Automata, Languages and Programming : 28th International Colloquium, ICALP 2001, Proceedings. Berlin: Springer-Verlag, 2001, s. 603-614. ISBN 3-540-42287-0.

KUNC, Michal. Free partially commutative semigroups in band varieties. In Proceedings of 58th Workshop on General Algebra"58. Arbeitstagung Allgemeine Algebra". Klagenfurt: Verlag Johannes Heyn, 2000, s. 257-268. ISBN 3-85366-951-4.