The \(3x+1\) problem as a string rewriting system

DOI10.1155/2010/458563zbMath1229.11022OpenAlexW2028841589WikidataQ58651769 ScholiaQ58651769MaRDI QIDQ623692

Joseph Sinyor

Publication date: 8 February 2011

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2010/458563

zbMATH Keywords

\(3x+1\) problem

Mathematics Subject Classification ID

Recurrences (11B37) Grammars and rewriting systems (68Q42)

Cites Work

• The dynamical system generated by the \(3n+1\) function
• The 3x + 1 Problem and Its Generalizations
• On the Collatz 3n + 1 Algorithm
• Maximum excursion and stopping time record-holders for the problem: Computational results
• On the \(3x+1\) problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(3x+1\) problem as a string rewriting system