In this paper we study various modifications of the notion of uniform recurrence in multidimensional infinite words. A d-dimensional infinite word is said to be uniformly recurrent if for each (Formula Presented) there exists (Formula Presented) such that each block of size (Formula Presented) contains the prefix of size (Formula Presented). We introduce and study a new notion of uniform recurrence of multidimensional infinite words: for each rational slope (Formula Presented), each rectangular prefix must occur along this slope, that is in positions (Formula Presented), with bounded gaps. Such words are called uniformly recurrent along all directions. We provide several constructions of multidimensional infinite words satisfying this condition, and more generally, a series of three conditions on recurrence. We study general properties of these new notions and in particular we study the strong uniform recurrence of fixed points of square morphisms.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - 13th International Conference, LATA 2019, Proceedings
EditorsDana Shapira, Alexander Okhotin, Carlos Martín-Vide
PublisherSpringer Nature
Pages397-408
Number of pages12
ISBN (Print)9783030134341
DOIs
StatePublished - 1 Jan 2019
Event13th International Conference on Language and Automata Theory and Applications, LATA 2019 - St. Petersburg, Russian Federation
Duration: 26 Mar 201929 Mar 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11417 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on Language and Automata Theory and Applications, LATA 2019
Country/TerritoryRussian Federation
CitySt. Petersburg
Period26/03/1929/03/19

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

    Research areas

  • Multidimensional morphisms, Multidimensional words, Uniform recurrence

ID: 41185832