The following pages link to Michal Kunc (Q443745):
Displayed 34 items.
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- On structure and representations of cyclic automata (Q897902) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Undecidability of the trace coding problem and some decidable cases (Q1884985) (← links)
- Quotient complexity of ideal languages (Q1935811) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- Language equations (Q2074222) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- On the boundary of regular languages (Q2344745) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- The generalized rank of trace languages (Q2408807) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Computing by commuting. (Q2490820) (← links)
- Regular solutions of language inequalities and well quasi-orders (Q2581271) (← links)
- The power of commuting with finite sets of words (Q2643146) (← links)
- Reversibility of Computations in Graph-Walking Automata (Q2849946) (← links)
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata (Q3100939) (← links)
- (Q3396551) (← links)
- On Decidability of Intermediate Levels of Concatenation Hierarchies (Q3451089) (← links)
- Communication of Two Stacks and Rewriting (Q3591427) (← links)
- Algebraic Characterization of the Finite Power Property (Q3613754) (← links)
- (Q4453870) (← links)
- (Q4510924) (← links)
- (Q4535801) (← links)
- Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (Q5199977) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- The Generalized Rank of Trace Languages (Q5384435) (← links)
- The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable (Q5444976) (← links)
- Automata, Languages and Programming (Q5466521) (← links)
- Developments in Language Theory (Q5473683) (← links)
- STACS 2005 (Q5710708) (← links)