The following pages link to Codes et motifs (Q3031953):
Displaying 15 items.
- Conjugacy relations of prefix codes (Q287447) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- The commutation of finite sets: A challenging problem (Q1605327) (← links)
- Conway's problem for three-word sets. (Q1853553) (← links)
- A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571) (← links)
- Simple equations on binary factorial languages (Q2271433) (← links)
- Playing with Conway's problem (Q2378537) (← links)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
- Commutation with codes (Q2484442) (← links)
- Motifs et bases de langages (Q3031947) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- On the simplest centralizer of a language (Q3431440) (← links)
- ON THE ROOT OF LANGUAGES (Q4786297) (← links)
