Codes et motifs
From MaRDI portal
Recommendations
Cites work
- A factor theorem for subsets of a free monoid
- Codes conjugués
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3633741 (Why is no real title available?)
- scientific article; zbMATH DE number 3332047 (Why is no real title available?)
- scientific article; zbMATH DE number 3367062 (Why is no real title available?)
- scientific article; zbMATH DE number 3099365 (Why is no real title available?)
- Motifs et bases de langages
- The equation \(a_ M=b^ Nc^ P\) in a free group
Cited in
(17)- Conjugacy of finite biprefix codes
- The commutation of finite sets: A challenging problem
- Conway's problem for three-word sets.
- A non-ambiguous decomposition of regular languages and factorizing codes
- Simple equations on binary factorial languages
- Playing with Conway's problem
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- Commutation with codes
- Conjugacy relations of prefix codes
- Motifs et bases de langages
- On Conjugacy of Languages
- On the simplest centralizer of a language
- scientific article; zbMATH DE number 4043285 (Why is no real title available?)
- ON THE ROOT OF LANGUAGES
- scientific article; zbMATH DE number 3895249 (Why is no real title available?)
- On the complexity of decidable cases of the commutation problem of languages
- Equations over finite sets of words and equivalence problems in automata theory
This page was built for publication: Codes et motifs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3031953)
