Codes conjugués
From MaRDI portal
Publication:5668358
DOI10.1016/S0019-9958(72)90406-8zbMath0254.94015MaRDI QIDQ5668358
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
Prefix codes and isomorphic automata, Unique decipherability in the additive monoid of sets of numbers, Unique decipherability in the monoid of languages: an application of rational relations, Equations over finite sets of words and equivalence problems in automata theory, On the existence of prime decompositions, A note on autodense related languages, Conjugacy of finite biprefix codes, Some free submonoids of the free monoid of prefix codes, Prefix codes, trees, and automata, Right \(k\)-dense languages, Free submonoids in the monoid of languages, On certain codes admitting inverse semigroups as syntactic monoids, Commutation with codes, On Language Decompositions and Primality, Codes et motifs, On Conjugacy of Languages, Unique Decipherability in the Monoid of Languages: An Application of Rational Relations, On the simplest centralizer of a language, An equivalence relation on suffix codes defined by generalized regular languages, A note on the free submonoids of the monoid of prefix codes
