About: Given an alphabet A and a binary relation [Formula: see text], a language [Formula: see text] is [Formula: see text]-independent if [Formula: see text]; X is [Formula: see text]-closed if [Formula: see text]. The language X is complete if any word over A is a factor of some concatenation of words in X. Given a family of languages [Formula: see text] containing X, X is maximal in [Formula: see text] if no other set of [Formula: see text] can strictly contain X. A language [Formula: see text] is a variable-length code if any equation among the words of X is necessarily trivial. The study discusses the relationship between maximality and completeness in the case of [Formula: see text]-independent or [Formula: see text]-closed variable-length codes. We focus to the binary relations by which the images of words are computed by deleting, inserting, or substituting some characters.   Goto Sponge  NotDistinct  Permalink

An Entity of Type : fabio:Abstract, within Data Space : wasabi.inria.fr associated with source document(s)

AttributesValues
type
value
  • Given an alphabet A and a binary relation [Formula: see text], a language [Formula: see text] is [Formula: see text]-independent if [Formula: see text]; X is [Formula: see text]-closed if [Formula: see text]. The language X is complete if any word over A is a factor of some concatenation of words in X. Given a family of languages [Formula: see text] containing X, X is maximal in [Formula: see text] if no other set of [Formula: see text] can strictly contain X. A language [Formula: see text] is a variable-length code if any equation among the words of X is necessarily trivial. The study discusses the relationship between maximality and completeness in the case of [Formula: see text]-independent or [Formula: see text]-closed variable-length codes. We focus to the binary relations by which the images of words are computed by deleting, inserting, or substituting some characters.
subject
  • Historical linguistics
  • Lossless compression algorithms
  • Binary operations
  • Formal languages
  • String (computer science)
  • Coding theory
  • Operators (programming)
  • Character encoding
  • Language families
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software