Michal Kunc

26 papers A* 2A 1B 2C 5Journal 12Unranked 3
YearRankTypeTitle / Venue / Authors
2021 — ch.
Language equations.
Handbook of Automata Theory (I.)
Michal Kunc, Alexander Okhotin
2020 J jnl
Reversibility of computations in graph-walking automata.
Inf. Comput.
Michal Kunc, Alexander Okhotin
2019 J jnl
The Generalized Rank of Trace Languages.
Int. J. Found. Comput. Sci.
Michal Kunc, Jan Meitner
2017 C conf
The Generalized Rank of Trace Languages.
DLT
Michal Kunc, Jan Meitner
2016 J jnl
The omega-inequality problem for concatenation hierarchies of star-free languages.
CoRR
Jorge Almeida, Ondrej Klíma, Michal Kunc
2015 C conf
On Decidability of Intermediate Levels of Concatenation Hierarchies.
DLT
Jorge Almeida, Jana Bartonová, Ondrej Klíma, Michal Kunc
2013 B conf
Reversibility of Computations in Graph-Walking Automata.
MFCS
Michal Kunc, Alexander Okhotin
2012 J jnl
State complexity of operations on two-way finite automata over a unary alphabet.
Theor. Comput. Sci.
Michal Kunc, Alexander Okhotin
2011 C conf
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups.
Developments in Language Theory
Michal Kunc, Alexander Okhotin
2011 — conf
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet.
DCFS
Michal Kunc, Alexander Okhotin
2011 J jnl
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata.
Fundam. Informaticae
Michal Kunc, Alexander Okhotin
2010 J jnl
Computational power of two stacks with restricted communication.
Inf. Comput.
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
2007 J jnl
The Power of Commuting with Finite Sets of Words.
Theory Comput. Syst.
Michal Kunc
2007 B conf
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable.
FCT
Michal Kunc
2007 C conf
What Do We Know About Language Equations?
Developments in Language Theory
Michal Kunc
2006 — conf
Algebraic Characterization of the Finite Power Property.
ICALP (1)
Michal Kunc
2006 — conf
Communication of Two Stacks and Rewriting.
ICALP (2)
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
2006 J jnl
Computing by commuting.
Theor. Comput. Sci.
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
2005 C conf
On Language Inequalities XK subset of LX.
Developments in Language Theory
Michal Kunc
2005 J jnl
Regular solutions of language inequalities and well quasi-orders.
Theor. Comput. Sci.
Michal Kunc
2005 J jnl
Simple language Equations.
Bull. EATCS
Michal Kunc
2005 A conf
The Power of Commuting with Finite Sets of Words.
STACS
Michal Kunc
2004 A* conf
Regular Solutions of Language Inequalities and Well Quasi-orders.
ICALP
Michal Kunc
2004 J jnl
Undecidability of the trace coding problem and some decidable cases.
Theor. Comput. Sci.
Michal Kunc
2003 J jnl
Equational description of pseudovarieties of homomorphisms.
RAIRO Theor. Informatics Appl.
Michal Kunc
2001 A* conf
The Trace Coding Problem Is Undecidable.
ICALP
Michal Kunc