appearance

MU › FI › About the faculty › People Search at MU › Personal page › Publications

Masaryk University - Faculty of Informatics

Skip navigation

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

Faculty of Informatics

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

Basic CV Supervisor Qualifications Publications Projects Teaching

2011

Describing periodicity in two-way deterministic finite automata using transformation semigroups

KUNC, Michal - OKHOTIN, Alexander.
Describing periodicity in two-way deterministic finite automata using transformation semigroups. In Developments in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings. Berlin : Springer, 2011. ISBN 978-3-642-22320-4, pp. 324-336. 2011, Milan, Italy.

State complexity of operations on two-way deterministic finite automata over a unary alphabet

KUNC, Michal - OKHOTIN, Alexander.
State complexity of operations on two-way deterministic finite automata over a unary alphabet. In Descriptional Complexity of Formal Systems: 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Berlin : Springer, 2011. ISBN 978-3-642-22599-4, pp. 222-234. 2011, Gießen/Limburg, Germany.

State complexity of union and intersection for two-way nondeterministic finite automata

KUNC, Michal - OKHOTIN, Alexander.
State complexity of union and intersection for two-way nondeterministic finite automata. Fundamenta Informaticae, Amsterdam, IOS Press, The Nederlands. ISSN 0169-2968, 2011, vol. 110, no. 1-4, pp. 231-239.

2010

Computational power of two stacks with restricted communication

KARHUMÄKI, Juhani - KUNC, Michal - OKHOTIN, Alexander.
Computational power of two stacks with restricted communication. Information and Computation, Amsterdam, Elsevier, The Nederlands. ISSN 0890-5401, 2010, vol. 208, no. 9, pp. 1060-1089.

2007

The power of commuting with finite sets of words

KUNC, Michal.
The power of commuting with finite sets of words. Theory of Computing Systems, New York, Springer, USA. ISSN 1432-4350, 2007, vol. 40, no. 4, pp. 521-551.

The simplest language where equivalence of finite substitutions is undecidable

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. ISBN 978-3-540-74239-5, pp. 365-375. 2007, Budapest, Hungary.

What do we know about language equations?

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. ISBN 978-3-540-73207-5, pp. 23-27. 2007, Turku, Finland.

2006

Algebraic characterization of the finite power property

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. ISBN 3-540-35904-4, pp. 120-131. 2006, Venice, Italy.

Communication of two stacks and rewriting

KARHUMÄKI, Juhani - KUNC, Michal - OKHOTIN, Alexander.
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. ISBN 3-540-35907-9, pp. 468-479. 2006, Venice, Italy.

Computing by commuting

KARHUMÄKI, Juhani - KUNC, Michal - OKHOTIN, Alexander.
Computing by commuting. Theoretical Computer Science, Amsterdam, Elsevier, The Nederlands. ISSN 0304-3975, 2006, vol. 356, no. 1-2, pp. 200-211.

2005

Largest solutions of left-linear language inequalities

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. pp. 178-186. 2005, Dobogókő, Hungary.

On language inequalities XK ⊆ LX

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. ISBN 3-540-26546-5, pp. 327-337. 2005, Palermo, Italy.

Regular solutions of language inequalities and well quasi-orders

KUNC, Michal.
Regular solutions of language inequalities and well quasi-orders. Theoretical Computer Science, Amsterdam, Elsevier, The Nederlands. ISSN 0304-3975, 2005, vol. 348, no. 2-3, pp. 277-293.

Simple language equations

KUNC, Michal.
Simple language equations. Bulletin of the European Association for Theoretical Computer Science EATCS, Great Britain. ISSN 0252-9742, 2005, vol. 85, no. February, pp. 81-102.

The power of commuting with finite sets of words

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. ISBN 3-540-24998-2, pp. 569-580. 2005, Stuttgart, Germany.

2004

Regular solutions of language inequalities and well quasi-orders

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. ISBN 3-540-22849-7, pp. 870-881. 2004, Turku, Finland.

Undecidability of the trace coding problem and some decidable cases

KUNC, Michal.
Undecidability of the trace coding problem and some decidable cases. Theoretical Computer Science, Amsterdam, Elsevier, The Nederlands. ISSN 0304-3975, 2004, vol. 310, no. 1-3, pp. 393-456.

2003

Equational description of pseudovarieties of homomorphisms

KUNC, Michal.
Equational description of pseudovarieties of homomorphisms. RAIRO - Theoretical Informatics and Applications, Les Ulis (Francie), EDP Sciences, France. ISSN 0988-3754, 2003, vol. 37, no. 3, pp. 243-254.

2001

The trace coding problem is undecidable (extended abstract)

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. ISBN 3-540-42287-0, pp. 603-614. July 8-12, 2001, Crete, Greece.

2000

Free partially commutative semigroups in band varieties

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. ISBN 3-85366-951-4, pp. 257-268. June 3-6, 1999, Vienna University of Technology,.

top