scientific article; zbMATH DE number 6810360

DOI10.25596/jalc-2016-311zbMath1380.68255arXiv1507.00600MaRDI QIDQ4590911

Mitja Mastnak, Stavros Konstantinidis

Publication date: 20 November 2017

Full work available at URL: https://arxiv.org/abs/1507.00600

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

embeddingvariable-length codeslanguagestransducersmaximal codeserror control codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (7)

Unnamed Item ⋮ Approximate NFA universality and related problems motivated by information theory ⋮ When variable-length codes meet the field of error detection ⋮ Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem ⋮ Topologies for error-detecting variable-length codes ⋮ Theoretical and implementational aspects of the formal language server (LaSer) ⋮ Approximate NFA universality motivated by information theory

This page was built for publication: