scientific article; zbMATH DE number 3332047
From MaRDI portal
Publication:5610821
zbMath0208.45101MaRDI QIDQ5610821
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Prefix, length-variable, comma-free codes (94A45)
Related Items (33)
Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht ⋮ Synchronization and decomposability for a family of codes. II ⋮ Unnamed Item ⋮ On the word problem for special monoids ⋮ Bi-infinitary codes ⋮ Le degré minimal du groupe d'un code biprefixe fini ⋮ Sur le théorème du defaut ⋮ La représentation ergodique d'un automate fini ⋮ A representation of trees by languages. II ⋮ Regular semigroups with D=R as syntactic monoids of prefix codes ⋮ Unnamed Item ⋮ Maximal codes with bounded deciphering delay ⋮ Unnamed Item ⋮ Codes et motifs ⋮ Prefix codes, trees, and automata ⋮ On monoids presented by a single relation ⋮ On codes with a finite deciphering delay: Constructing uncompletable words ⋮ Transductions des langages de Chomsky ⋮ Epimorphisms of free monoids ⋮ On codes having no finite completions ⋮ Regular prefix codes and right power-bounded languages ⋮ A representation of trees by languages. I ⋮ A combinatorial property of codes having finite synchronization delay ⋮ Codes asynchrones ⋮ On a complete set of operations for factorizing codes ⋮ Bracketed context-free languages ⋮ On completion of codes with finite deciphering delay ⋮ An extension to trees of the Sardinas and Patterson algorithm ⋮ The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids ⋮ A feature constraint system for logic programming with entailment ⋮ Sur certains sous-monoïdes libres ⋮ Test sets for morphisms with bounded delay ⋮ Locally complete sets and finite decomposable codes
This page was built for publication:
