The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michal Kunc: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.048secs, Finished in 0.049secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002