| |
| 2007 | ||
|---|---|---|
| 14 | EE | Michal Kunc: What Do We Know About Language Equations? Developments in Language Theory 2007: 23-27 |
| 13 | EE | Michal Kunc: The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. FCT 2007: 365-375 |
| 12 | EE | Michal Kunc: The Power of Commuting with Finite Sets of Words. Theory Comput. Syst. 40(4): 521-551 (2007) |
| 2006 | ||
| 11 | EE | Michal Kunc: Algebraic Characterization of the Finite Power Property. ICALP (1) 2006: 120-131 |
| 10 | EE | Juhani Karhumäki, Michal Kunc, Alexander Okhotin: Communication of Two Stacks and Rewriting. ICALP (2) 2006: 468-479 |
| 9 | EE | Juhani Karhumäki, Michal Kunc, Alexander Okhotin: Computing by commuting. Theor. Comput. Sci. 356(1-2): 200-211 (2006) |
| 2005 | ||
| 8 | EE | Michal Kunc: On Language Inequalities XK subset of LX. Developments in Language Theory 2005: 327-337 |
| 7 | EE | Michal Kunc: The Power of Commuting with Finite Sets of Words. STACS 2005: 569-580 |
| 6 | Michal Kunc: Simple language Equations. Bulletin of the EATCS 85: 81-102 (2005) | |
| 5 | EE | Michal Kunc: Regular solutions of language inequalities and well quasi-orders. Theor. Comput. Sci. 348(2-3): 277-293 (2005) |
| 2004 | ||
| 4 | EE | Michal Kunc: Regular Solutions of Language Inequalities and Well Quasi-orders. ICALP 2004: 870-881 |
| 3 | EE | Michal Kunc: Undecidability of the trace coding problem and some decidable cases. Theor. Comput. Sci. 310(1-3): 393-456 (2004) |
| 2003 | ||
| 2 | EE | Michal Kunc: Equational description of pseudovarieties of homomorphisms. ITA 37(3): 243-254 (2003) |
| 2001 | ||
| 1 | EE | Michal Kunc: The Trace Coding Problem Is Undecidable. ICALP 2001: 603-614 |
| 1 | Juhani Karhumäki | [9] [10] |
| 2 | Alexander Okhotin | [9] [10] |