Finite automata for testing composition-based reconstructibility of sequences

DOI10.1016/J.JCSS.2007.10.004zbMath1140.68035arXivcs/0507052OpenAlexW2041411237MaRDI QIDQ931728

Huimin Xie, Qiang Li

Publication date: 26 June 2008

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

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

zbMATH Keywords

uniquenessdeterministic finite automatasequence reconstructionfactorial languageEulerian trail

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Deciding unique decodability of bigram counts via finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniquely decodable \(n\)-gram embeddings
• Eulerian graphs and related topics. Part 1, Volume 1
• Approximate string-matching with \(q\)-grams and maximal matches
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Phase transition in sequence unique reconstruction
• Grammatical Complexity and One-Dimensional Dynamical Systems
• Shuffling biological sequences

This page was built for publication: Finite automata for testing composition-based reconstructibility of sequences