Pages that link to "Item:Q1853744"

The following pages link to Composition sequences for functions over a finite domain. (Q1853744):

Displaying 20 items.

• Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134) (← links)
• On the state complexity of reversals of regular languages (Q596099) (← links)
• The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
• Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
• Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
• Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
• Synchronizing generalized monotonic automata (Q1763695) (← links)
• Černý's conjecture and the road colouring problem (Q2074216) (← links)
• Preset Distinguishing Sequences and Diameter of Transformation Semigroups (Q2799186) (← links)
• Composition Sequences and Synchronizing Automata (Q2891329) (← links)
• THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE (Q2909105) (← links)
• Minimal Reaction Systems Defining Subset Functions (Q2944907) (← links)
• Undecidability of State Complexities Using Mirror Images (Q3166954) (← links)
• Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
• Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
• On the Computational Complexity of Monotone Constraint Satisfaction Problems (Q3605505) (← links)
• Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (Q5200068) (← links)
• On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
• Compositions of Functions and Permutations Specified by Minimal Reaction Systems (Q5384527) (← links)
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123) (← links)