The 3x+1 problem as a string rewriting system

DOI10.1155/2010/458563zbMATH Open1229.11022DBLPjournals/ijmmsc/Sinyor10OpenAlexW2028841589WikidataQ58651769 ScholiaQ58651769MaRDI QIDQ623692FDOQ623692

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

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

Cites Work

• Title not available (Why is that?)
• The dynamical system generated by the \(3n+1\) function
• The 3x + 1 Problem and Its Generalizations
• Title not available (Why is that?)
• On the Collatz 3n + 1 Algorithm
• Title not available (Why is that?)
• Maximum excursion and stopping time record-holders for the problem: Computational results
• On the \(3x+1\) problem

Cited In (1)

• Three one-way heads cannot do string matching

   Recommendations

• The 3x + 1 Problem and Its Generalizations 👍 👎
• On the \(3x+1\) problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The congruence structure of the \(3x+1\) map 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623692)