Skip to main content
Article thumbnail
Location of Repository

MULTIDIMENSIONAL GENERALIZED AUTOMATIC SEQUENCES AND SHAPE-SYMMETRIC MORPHIC WORDS

By Emilie Charlier, Tomi Kärki and Michel Rigo

Abstract

An infinite word is S-automatic if, for all n ≥ 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this paper, we consider an analogous definition in a multidimensional setting and study the relationship with the shape-symmetric infinite words as introduced by Arnaud Maes. Precisely, for d ≥ 2, we show that a multidimensional infinite word x: N d → Σ over a finite alphabet Σ is S-automatic for some abstract numeration system S built on a regular language containing the empty word if and only if x is the image by a coding of a shape-symmetric infinite word

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.313.7931
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0907.0615... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.