On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

@inproceedings{Pritykin2007OnAP,
  title={On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases},
  author={Yuri Pritykin},
  booktitle={Developments in Language Theory},
  year={2007}
}
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with xed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given. 

From This Paper

Topics from this paper.
3 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

  • Yu. Pritykin
  • Accepted to Developments in Language Theory…
  • 2007
1 Excerpt

Finite-Automaton Transformations of Strictly Almost-Periodic Sequences

  • Yu. L. Pritykin
  • Mathematical Notes,
  • 2006
1 Excerpt

Logical theories of one-place functions on the set of natural numbers

  • A. L. Semenov
  • Math. of USSR, Izvestia,
  • 1983
2 Excerpts

On certain extensions of the arithmetic of addition of natural numbers

  • A. L. Semenov
  • Math. of USSR, Izvestia,
  • 1980
1 Excerpt

Semenov . On certain extensions of the arithmetic of addition of natural numbers

  • L. A.
  • Math . of USSR , Izvestia
  • 1980

Similar Papers

Loading similar papers…