The following pages link to (Q4529991):
Displaying 16 items.
- Conjugacy relations of prefix codes (Q287447) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- Problems in combinatorics on words originating from discrete dynamical systems (Q1293446) (← links)
- Three distance theorems and combinatorics on words (Q1594925) (← links)
- Reduced word enumeration, complexity, and randomization (Q2144333) (← links)
- The power of commuting with finite sets of words (Q2643146) (← links)
- Sixteen problems in informatics. With detailed corrections and Caml programs and with 18 pictures (Q2710183) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- Computing Minimum Length Representations of Sets of Words of Uniform Length (Q2946043) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- Counting occurrences for a finite set of words (Q3189073) (← links)
- (Q3687732) (← links)
- (Q4665742) (← links)
- Word Problems and Membership Problems on Compressed Words (Q5470731) (← links)
- Machines, Computations, and Universality (Q5710891) (← links)