The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michal Kunc" ( http://dblp.L3S.de/Authors/Michal_Kunc )

  Author page on DBLP  Author page in RDF  Community of Michal Kunc in ASPL-2

Publication years (Num. hits)
2001-2010 (15) 2011 (3)
Publication types (Num. hits)
article(8) inproceedings(10)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 18 publication records. Showing 18 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michal Kunc, Alexander Okhotin State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michal Kunc, Alexander Okhotin Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. Search on Bibsonomy Developments in Language Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michal Kunc, Alexander Okhotin State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. Search on Bibsonomy DCFS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Juhani Karhumäki, Michal Kunc, Alexander Okhotin Computational power of two stacks with restricted communication. Search on Bibsonomy Inf. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michal Kunc The Power of Commuting with Finite Sets of Words. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michal Kunc The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. Search on Bibsonomy FCT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michal Kunc What Do We Know About Language Equations? Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Juhani Karhumäki, Michal Kunc, Alexander Okhotin Computing by commuting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michal Kunc Algebraic Characterization of the Finite Power Property. Search on Bibsonomy ICALP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Juhani Karhumäki, Michal Kunc, Alexander Okhotin Communication of Two Stacks and Rewriting. Search on Bibsonomy ICALP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michal Kunc Regular solutions of language inequalities and well quasi-orders. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michal Kunc Simple language Equations. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2005 DBLP  BibTeX  RDF
1Michal Kunc The Power of Commuting with Finite Sets of Words. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michal Kunc On Language Inequalities XK subset of LX. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michal Kunc Undecidability of the trace coding problem and some decidable cases. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michal Kunc Regular Solutions of Language Inequalities and Well Quasi-orders. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michal Kunc Equational description of pseudovarieties of homomorphisms. Search on Bibsonomy ITA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Michal Kunc The Trace Coding Problem Is Undecidable. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #18 of 18 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.