Kitaev, Sergey and Mansour, Toufik and Seebold, Patrice (2004) Generating the Peano curve and counting occurrences of some patterns. Journal of Automata, Languages and Combinatorics, 9 (4). pp. 439-455.Full text not available in this repository. Request a copy from the Strathclyde author
We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We find the number of occurrences of certain patterns in these words. We give a tag-system to generate automatically these words and, by showing that they are almost cube-free, we prove that they cannot be obtained by simply iterating a morphism.
|Keywords:||Electronic computers. Computer science, Computational Theory and Mathematics|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||17 Sep 2014 13:00|
|Last modified:||03 Apr 2017 00:07|