The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings

Fred Lunnon. The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings. In Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy, editors, Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings. pages 169-190, Cork University Press, 2008.

@inproceedings{Lunnon08,
  title = {The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings},
  author = {Fred Lunnon},
  year = {2008},
  researchr = {https://researchr.org/publication/Lunnon08},
  cites = {0},
  citedby = {0},
  pages = {169-190},
  booktitle = {Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings},
  editor = {Turlough Neary and Damien Woods and Anthony Karel Seda and Niall Murphy},
  publisher = {Cork University Press},
  isbn = {978-1-906642-00-6},
}