Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words

DOI10.1007/S10559-015-9708-YzbMath1327.68184OpenAlexW2047076386MaRDI QIDQ895104

M. V. Ulyanov, Yu. G. Smetanin

Publication date: 26 November 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9708-y

zbMATH Keywords

reconstruction of wordscombinatorics of wordsforbidden wordEuler pathde Bruijn multidigraph

Mathematics Subject Classification ID

Combinatorics on words (68R15) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Algorithms on strings (68W32)

Cites Work

• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
• An Introduction to Symbolic Dynamics and Coding
• Words and special factors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words