Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Burckel. Systémes congruentiels. Technical report, Séminaire de logique et algorithmique. Université de Rouen, 1992.
S. Burckel. Functional equations associated with congruential functions. Theoretical Computer Science, 123(2):397–406, 1994.
D. Caucal. On the regular structure of prefix rewriting. Theorical Computer Science, 106:61–86, 1992.
D. Caucal. Bisimulation of context-free grammars and of pushdown automata. CSLI Modal logic and process algebra, 53:85–106, 1995.
J.H. Conway. Unpredictable iterations. In Number Theory, pages 49–52, 1972.
B. Courcelle. Graph rewriting, an algebraic and logic approach. In J. Van Leuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 193–242, 1990. Elsevier.
J. C. Lagarias. The 3x+1 problem and its generalizations. The American Mathematical Monthly, 92(1):3–23, 1985.
C. Morvan. On rational graphs. Fossacs 2000, 2000.
D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 1985.
D. Perrin. Finite automata. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 1–53. North Holland, 1990.
Shallit and Wilson. The “3x+1” problem and finite automata. BEATCS: Bulletin of the European Association for Theoretical Computer Science, 46, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urvoy, T. (2000). Regularity of Congruential Graphs. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_63
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67901-1
Online ISBN: 978-3-540-44612-5
eBook Packages: Springer Book Archive