On morphisms and nested recurrence relations
Sunil Chandran,
Computer Science and Automation Department,
Indian Institute of Science, Bangalore, India.
Anita Das,
Computer Science and Automation Department,
Indian Institute of Science, Bangalore, India.
Frank Ruskey,
Department of Computer Science,
University of Victoria, Canada.
Abstract:
We explore a family of nested recurrence relations with arbitrary
levels of nesting, which have an interpretation in terms of fixed
points of morphisms over a countably infinite alphabet. Recurrences
in this family are related to a number of well-known sequences, including
Hofstadter's $G$ sequence and the Conolly and Tanny sequences.
-
Download: arXiv:1307.0153.
-
Please feel free to send me a note if
you download one of these files.
It's always nice to know who's reading your papers.
-
Selected citations:
Back to list of publications.
