
doc. Mgr. Michal Kunc, Ph.D.
docent – Ústav matematiky a statistiky
kancelář: pav. 08/02014b
Kotlářská 267/2
611 37 Brno
telefon: | 549 49 4839 |
---|---|
e‑mail: | kunc@math.muni.cz |
sociální a akademické sítě: |
---|
Počet publikací: 28
2011
-
State complexity of union and intersection for two-way nondeterministic finite automata
Fundamenta Informaticae, rok: 2011, ročník: 110, vydání: 1-4, DOI
2010
-
Computational power of two stacks with restricted communication
Information and Computation, rok: 2010, ročník: 208, vydání: 9
2007
-
The power of commuting with finite sets of words
Theory of Computing Systems, rok: 2007, ročník: 40, vydání: 4
-
The simplest language where equivalence of finite substitutions is undecidable
Fundamentals of Computation Theory: 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007. Proceedings, rok: 2007
-
What do we know about language equations?
Developments in Language Theory: 11th International Conference, DLT 2007, Turku, Finland, July 2007, Proceedings, rok: 2007
2006
-
Algebraic characterization of the finite power property
Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, rok: 2006
-
Communication of two stacks and rewriting
Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, rok: 2006
-
Computing by commuting
Theoretical Computer Science, rok: 2006, ročník: 356, vydání: 1-2
2005
-
Largest solutions of left-linear language inequalities
Automata and Formal Languages: 11th International Conference, AFL 2005, Dobogókő, Hungary, May 17-20. Proceedings, rok: 2005
-
On language inequalities XK ⊆ LX
Developments in Language Theory: 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005. Proceedings, rok: 2005