• Skip the Organizational structure panel
• Organizational structure

  On selecting a constituent part of MU the "Staff" page will be displayed with information relevant to the selected constituent part. The "Staff" page is not available for non-activated items.

  Masaryk University

  • Faculties
  • Law
  • Medicine
  • Science
  • Arts
  • Education
  • Economics
  • Informatics
  • Social Studies
  • Sports Studies

  • Institutes
  • Computer Science
  • CEITEC MU
  • Politica
  • Specialized Units
  • Hostels & Canteens
  • University Press
  • Telč Centre
  • UCB Management

  • Rector`s Office
  • Rectorate
  • Other Units
  • Archive
  • Language Centre
  • International Studies
  • Disabled Students
  • Technology Transfer
  • Biostatistics
  • Mendel Museum
  • CERIT
  • Civic Education
  • Project Team CEITEC

   

Assoc. Prof. Mgr. Michal Kunc, Ph.D.

 

• doc. Mgr. Michal Kunc, Ph.D.
  born July 31, 1974, Brno
  single

• Masaryk University
  Faculty of Science
  Department of Mathematics and Statistics
  Janáčkovo nám. 2a
  602 00 Brno
  Czech Republic

• associate professor

• 2010: habilitation; MU Brno; thesis title: Implicit Language Equations
• 2004: Ph.D. in Algebra; MU Brno; thesis title: Deciding Existence of Trace Codings
• 1997: Mgr. in Mathematics; MU Brno; thesis title: Hyperidentities of Type (2)

• since 2010: Masaryk University Brno, associate professor
• 2000 - 2001, 2003 - 2010: Masaryk University Brno, researcher

• Lectures: Graph theory, Linear algebra, Linear programming, Semigroups and formal languages, Topology
• Tutorials: Algebra, Fundamentals of mathematics, Set theory

• Research interests: Combinatorics on words, formal language theory, semigroup theory, trace theory, decision problems, equational unification.
• Meeting organization: workshop on Equational Theory of Regular Languages 2009
• Programme Committee membership: DLT 2012, AutoMathA 2007, 2009, TALE 2007 (co-chairman), RP 2010, MEMICS 2007, 2008.
• Reviewer: Mathematical Reviews (since 2006)

• 2007 - 2010: Turun yliopisto, several short research visits.
• 2005: LIAFA, Université Paris 7, 1 month research stay.
• 2005: Turun yliopisto, 1 year research stay.
• 2000: Universidade de Coimbra, 3 months study stay.
• 1999: TU Dresden, 3 days study visit.

• 23.11.2010: Highlights of AutoMathA, Wien. (invited)
• 2.10. 2009: Seminar, Turun yliopisto.
• 8.-12.9. 2008: School on Algebraic Theory of Automata, Lisboa. (invited)
• 28.8. 2007: FCT 2007, Budapest.
• 4.7. 2007: DLT 2007, Turku. (invited)
• 27.4. 2007: Seminar, Turun yliopisto.
• 21.11. 2006: Colloquium, Faculty of Informatics, Masarykova univerzita Brno.
• 30.9. 2006: Algebraic Theory of Automata and Logic, Szeged. (invited)
• 11.7. 2006: ICALP 2006, Venezia.
• 6.7. 2005: DLT 2005, Mondello.
• 17.,24.6. 2005: Seminar, LIAFA, Université Paris 7.
• 20.5. 2005: AFL 2005, Dobogókő.
• 8.,15.4. 2005: Seminar, Turun yliopisto.
• 25.2. 2005: STACS 2005, Stuttgart.
• 12.7. 2004: ICALP 2004, Turku.
• 10.7. 2001: ICALP 2001, Crete.
• 20.7. 2000: Colloquium on Semigroups, Szeged.
• 19.4. 2000: Seminar, Universidade de Coimbra.
• 5.6. 1999: AAA58 workshop on General Algebra, Wien.
• 6.5. 1999: Seminar, TU Dresden.
• 6.9. 1997: Summer School on General Algebra and Ordered Sets, Štrbské Pleso.
• 5.4. 1997: Workshop on Hyperidentities and Clones, Potsdam.

• KUNC, Michal a Alexander OKHOTIN. State complexity of union and intersection for two-way nondeterministic finite automata. Fundamenta Informaticae, Amsterdam: IOS Press, 110, 1-4, od s. 231-239, 9 s. ISSN 0169-2968. 2011. doi:10.3233/FI-2011-540.  info
• 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. od s. 324-336, 13 s. ISBN 978-3-642-22320-4. doi:10.1007/978-3-642-22321-1_28.  info
• 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. od s. 222-234, 13 s. ISBN 978-3-642-22599-4. doi:10.1007/978-3-642-22600-7_18.  info
• KARHUMÄKI, Juhani a Michal KUNC a Alexander OKHOTIN. Computational power of two stacks with restricted communication. Information and Computation, Amsterdam: Elsevier, 208, 9s. 1060-1089. ISSN 0890-5401. 2010. URL info
• KUNC, Michal. The power of commuting with finite sets of words. Theory of Computing Systems, New York: Springer, 40, 4s. 521-551. ISSN 1432-4350. 2007. URL info
• 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.  info
• 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. URL info
• KARHUMÄKI, Juhani a Michal KUNC a Alexander OKHOTIN. Computing by commuting. Theoretical Computer Science, Amsterdam: Elsevier, 356, 1-2s. 200-211. ISSN 0304-3975. 2006. URL info
• 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. URL info
• KARHUMÄKI, Juhani a 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. URL info
• 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. URL info
• KUNC, Michal. Simple language equations. Bulletin of the European Association for Theoretical Computer Science EATCS, 85, Februarys. 81-102. ISSN 0252-9742. 2005.  info
• 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. URL info
• KUNC, Michal. Regular solutions of language inequalities and well quasi-orders. Theoretical Computer Science, Amsterdam: Elsevier, 348, 2-3s. 277-293. ISSN 0304-3975. 2005. URL info
• 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.  info
• KUNC, Michal. Undecidability of the trace coding problem and some decidable cases. Theoretical Computer Science, Amsterdam: Elsevier, 310, 1-3s. 393-456. ISSN 0304-3975. 2004. URL info
• 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. URL info
• KUNC, Michal. Equational description of pseudovarieties of homomorphisms. RAIRO - Theoretical Informatics and Applications, Les Ulis (Francie): EDP Sciences, 37, 3s. 243-254. ISSN 0988-3754. 2003. URL info
• 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.  info
• 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.  info

Last update: 2012/05/10