Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words

Details Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words

2009-07-03

arxiv.org/abs/0907.0615v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

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 extended abstract, we consider an analogous definition in a multidimensional setting and present the connection to the shape-symmetric infinite words introduced by Arnaud Maes. More precisely, for d>=2, we state that a multidimensional infinite word x : N^d \to \Sigma over a finite alphabet \Sigma 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.

Affiliated with

Also associated with

No associations

Rating

Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-705961