Uniquely decodable n-gram embeddings

DOI10.1016/J.TCS.2004.10.010zbMATH Open1086.68073OpenAlexW1977458360MaRDI QIDQ706633FDOQ706633

Aryeh Kontorovich

Publication date: 9 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.010

Recommendations

• Deciding unique decodability of bigram counts via finite automata
• A Unifying Framework for Finite Wordlength Realizations
• On uniqueness of alphabetic decoding
• A uniformization theorem for nested word to word transductions
• Decoding by Embedding: Correct Decoding Radius and DMT Optimality
• scientific article; zbMATH DE number 4033664
• Grammar-based codes: a new class of universal lossless source codes
• On a weighted embedding for pontograms

zbMATH Keywords

Embedding\(n\)-gramFinite state automatonFinite transducerString

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Eulerian graphs and related topics. Part 1, Volume 2
• On the complexity of minimum inference of regular sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The minimum consistent DFA problem cannot be approximated within any polynomial

Cited In (3)

• Finite automata for testing composition-based reconstructibility of sequences
• Phase transition in sequence unique reconstruction
• Deciding unique decodability of bigram counts via finite automata

This page was built for publication: Uniquely decodable \(n\)-gram embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706633)