Michal Kunc

According to our database1, Michal Kunc authored at least 22 papers between 2001 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Language equations.
Proceedings of the Handbook of Automata Theory., 2021

2020
Reversibility of computations in graph-walking automata.
Inf. Comput., 2020

2019
The Generalized Rank of Trace Languages.
Int. J. Found. Comput. Sci., 2019

2016
The omega-inequality problem for concatenation hierarchies of star-free languages.
CoRR, 2016

2015
On Decidability of Intermediate Levels of Concatenation Hierarchies.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2012
State complexity of operations on two-way finite automata over a unary alphabet.
Theor. Comput. Sci., 2012

2011
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata.
Fundam. Informaticae, 2011

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
Computational power of two stacks with restricted communication.
Inf. Comput., 2010

2007
The Power of Commuting with Finite Sets of Words.
Theory Comput. Syst., 2007

The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

What Do We Know About Language Equations?
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Computing by commuting.
Theor. Comput. Sci., 2006

Algebraic Characterization of the Finite Power Property.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Communication of Two Stacks and Rewriting.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Regular solutions of language inequalities and well quasi-orders.
Theor. Comput. Sci., 2005

Simple language Equations.
Bull. EATCS, 2005

On Language Inequalities XK subset of LX.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Undecidability of the trace coding problem and some decidable cases.
Theor. Comput. Sci., 2004

2003
Equational description of pseudovarieties of homomorphisms.
RAIRO Theor. Informatics Appl., 2003

2001
The Trace Coding Problem Is Undecidable.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001


  Loading...