| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430771 | Journal of Computer and System Sciences | 2008 | 5 Pages |
Abstract
Symbolic sequences uniquely reconstructible from all their substrings of length k compose a regular factorial language. We thoroughly characterize this language by its minimal forbidden words, and explicitly build up a deterministic finite automaton that accepts it. This provides an efficient on-line algorithm for testing the unique reconstructibility of the sequences.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
