default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Kunc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p1]Michal Kunc, Alexander Okhotin:
Language equations. Handbook of Automata Theory (I.) 2021: 765-799- 2020
- [j11]Michal Kunc, Alexander Okhotin:
Reversibility of computations in graph-walking automata. Inf. Comput. 275: 104631 (2020)
2010 – 2019
- 2019
- [j10]Michal Kunc, Jan Meitner
:
The Generalized Rank of Trace Languages. Int. J. Found. Comput. Sci. 30(1): 135-169 (2019) - 2017
- [c13]Michal Kunc, Jan Meitner:
The Generalized Rank of Trace Languages. DLT 2017: 247-259 - 2016
- [i1]Jorge Almeida, Ondrej Klíma, Michal Kunc:
The omega-inequality problem for concatenation hierarchies of star-free languages. CoRR abs/1601.08237 (2016) - 2015
- [c12]Jorge Almeida, Jana Bartonová, Ondrej Klíma, Michal Kunc:
On Decidability of Intermediate Levels of Concatenation Hierarchies. DLT 2015: 58-70 - 2013
- [c11]Michal Kunc, Alexander Okhotin:
Reversibility of Computations in Graph-Walking Automata. MFCS 2013: 595-606 - 2012
- [j9]Michal Kunc, Alexander Okhotin:
State complexity of operations on two-way finite automata over a unary alphabet. Theor. Comput. Sci. 449: 106-118 (2012) - 2011
- [j8]Michal Kunc, Alexander Okhotin:
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. Fundam. Informaticae 110(1-4): 231-239 (2011) - [c10]Michal Kunc, Alexander Okhotin:
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. DCFS 2011: 222-234 - [c9]Michal Kunc, Alexander Okhotin:
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. Developments in Language Theory 2011: 324-336 - 2010
- [j7]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Computational power of two stacks with restricted communication. Inf. Comput. 208(9): 1060-1089 (2010)
2000 – 2009
- 2007
- [j6]Michal Kunc:
The Power of Commuting with Finite Sets of Words. Theory Comput. Syst. 40(4): 521-551 (2007) - [c8]Michal Kunc:
What Do We Know About Language Equations? Developments in Language Theory 2007: 23-27 - [c7]Michal Kunc:
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. FCT 2007: 365-375 - 2006
- [j5]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Computing by commuting. Theor. Comput. Sci. 356(1-2): 200-211 (2006) - [c6]Michal Kunc:
Algebraic Characterization of the Finite Power Property. ICALP (1) 2006: 120-131 - [c5]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Communication of Two Stacks and Rewriting. ICALP (2) 2006: 468-479 - 2005
- [j4]Michal Kunc:
Simple language Equations. Bull. EATCS 85: 81-102 (2005) - [j3]Michal Kunc:
Regular solutions of language inequalities and well quasi-orders. Theor. Comput. Sci. 348(2-3): 277-293 (2005) - [c4]Michal Kunc:
On Language Inequalities XK subset of LX. Developments in Language Theory 2005: 327-337 - [c3]Michal Kunc:
The Power of Commuting with Finite Sets of Words. STACS 2005: 569-580 - 2004
- [j2]Michal Kunc:
Undecidability of the trace coding problem and some decidable cases. Theor. Comput. Sci. 310(1-3): 393-456 (2004) - [c2]Michal Kunc:
Regular Solutions of Language Inequalities and Well Quasi-orders. ICALP 2004: 870-881 - 2003
- [j1]Michal Kunc:
Equational description of pseudovarieties of homomorphisms. RAIRO Theor. Informatics Appl. 37(3): 243-254 (2003) - 2001
- [c1]Michal Kunc:
The Trace Coding Problem Is Undecidable. ICALP 2001: 603-614
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
