Michal Kunc

Publication Activity (10 Years)

Years Active: 2001-2020
Publications (10 Years): 5

Top Topics

Description Logics

Native Language

Finite Automaton

Expressive Power

Top Venues

Int. J. Found. Comput. Sci.

Publications

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