Sequences Defined by Iterated Morphisms

G. Rauzy
Additional contact information
G. Rauzy: Département de Mathématiques-Informatique, et U.R.A.225, Faculté des Sciences de Luminy - case 901 -

A chapter in Sequences, 1990, pp 275-286 from Springer

Abstract: Abstract Let A be a finite alphabet and t a morphism from A*(the set of words with letters in A) into itself, that is to say, a map such that for every words A and B of A*: $$t\left( {AB} \right) = t\left( A \right)t\left( B \right)$$ (so that t is entirely defined by its values on the letters of A).

Keywords: Reverse Problem; Finite Alphabet; Infinite Path; Infinite Word; Symbolical Interpretation (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_22

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().