Deciding unique decodability of bigram counts via finite automata

DOI10.1016/J.JCSS.2013.09.003zbMath1433.68197OpenAlexW2014550277MaRDI QIDQ386046

Ari Trachtenberg, Leonid (Aryeh) Kontorovich

Publication date: 13 December 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.09.003

zbMATH Keywords

uniquenessEulerian graphfinite-state automatasequence reconstruction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

An intelligent approach for building a secure decentralized public key infrastructure in VANET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniquely decodable \(n\)-gram embeddings
• Finite automata for testing composition-based reconstructibility of sequences
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

This page was built for publication: Deciding unique decodability of bigram counts via finite automata