Codes et motifs
From MaRDI portal
Publication:3031953
DOI10.1051/ita/1989230404251zbMath0689.68102OpenAlexW106053274MaRDI QIDQ3031953
Publication date: 1989
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92342
Related Items
ON THE ROOT OF LANGUAGES, Conjugacy relations of prefix codes, Playing with Conway's problem, On effective construction of the greatest solution of language inequality \(XA\subseteq BX\), Equations over finite sets of words and equivalence problems in automata theory, Motifs et bases de langages, Commutation with codes, On the complexity of decidable cases of the commutation problem of languages, Simple equations on binary factorial languages, Conjugacy of finite biprefix codes, On the simplest centralizer of a language, Conway's problem for three-word sets., A non-ambiguous decomposition of regular languages and factorizing codes, The commutation of finite sets: A challenging problem, On Conjugacy of Languages
Cites Work
