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