Reconstruction of a Word from a Finite Set of its Subwords under the unit Shift Hypothesis. I. Reconstruction without for Bidden Words1-Reference-Cited by-同舟云学术

Reconstruction of a Word from a Finite Set of its Subwords under the unit Shift Hypothesis. I. Reconstruction without for Bidden Words1

Published:2014-01 Issue:1 Volume:50 Page:148-156
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Smetanin Y. G.,Ulyanov M. V.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-014-9602-z.pdf

Reference25 articles.

1. J. E. Hopcroft, R. Motwani and J. D. Ullman, Introduction to Automata Theory, Languages and Computation [Russian translation], Izd. Dom “Williams,” Moscow (2008).

2. M. Morse and G. Hedlund, “Unending chess, symbolic dynamics, and a problem in semigroups,” Duke Math. J., No. 11, 1–7 (1944).

3. E. Simiu, Chaotic Transitions in Deterministic and Stochastic Dynamical Systems [Russian translation], Fizmatlit, Moscow (2007).

4. V. Afraimovich, E. Ugalde, and J. Urias, Fractal Dimensions for Poincare Recurrence Times [Russian translation], Inst. of Comp. Research, R&C Dynamics, Moscow-Izhevsk (2011).

5. D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge Univ. Press, Cambridge (UK) (1995).

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. About the possibility of determining the prefix and suffix of a word by subwords of fixed length;Business Informatics;2020-06-30

2. Reconstruction of a Word from a Finite Set of its Subwords Under the Unit Shift Hypothesis. II. Reconstruction with Forbidden Words;Cybernetics and Systems Analysis;2015-01