Handbook of theoretical computer science (vol. B)
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Functional equations associated with congruential functions
Theoretical Computer Science
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
The aim of this article is to make a link between the congruential systems investigated by Conway and the infinite graphs theory. We compare the graphs of congruential systems with a well known family of infinite graphs: the regular graphs of finite degree considered by Muller and Shupp, and by Courcelle. We first consider congruential systems as word rewriting systems to extract some subfamilies of congruential systems, the q-p-congruential systems, representing the regular graphs of finite degree. We then prove the non-regularity of the Collatz's graph.