Uniquely decodable \(n\)-gram embeddings

DOI10.1016/j.tcs.2004.10.010zbMath1086.68073OpenAlexW1977458360MaRDI QIDQ706633

Leonid (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

zbMATH Keywords

Embedding\(n\)-gramFinite state automatonFinite transducerString

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Eulerian graphs and related topics. Part 1, Volume 2
• The minimum consistent DFA problem cannot be approximated within any polynomial
• On the complexity of minimum inference of regular sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

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