Pages that link to "Item:Q1771315"
From MaRDI portal
The following pages link to Commutation with ternary sets of words (Q1771315):
Displaying 12 items.
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- Conway's problem for three-word sets. (Q1853553) (← links)
- Simple equations on binary factorial languages (Q2271433) (← links)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
- Commutation with codes (Q2484442) (← links)
- The power of commuting with finite sets of words (Q2643146) (← links)
- Commutation in global supermonoid of free monoids (Q2718446) (← links)
- On the simplest centralizer of a language (Q3431440) (← links)
- MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT (Q4024639) (← links)
- (Q4555771) (← links)
- STACS 2005 (Q5710708) (← links)
- Aspects of Molecular Computing (Q5901828) (← links)