scientific article; zbMATH DE number 17050

MaRDI QIDQ3973745zbMATH OpenFDO

Authors A. J. van Zanten

Publication date 26 June 1992

zbMATH Keywords

complexityformal languageGray codeTowers of Hanoi problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Review text

[For the entire collection see Zbl 0722.00014.] A formal language is defined, including rules for constructing arithmetic expressions using ten digits and three operators. The author then attacks the problem of counting the number of grammatically correct expressions containing \(n\) basis symbols. The Towers of Hanoi problem illustrates the complexity of algorithms. An \(n\)-bit code with \(2^ n\) words is called a Gray code if one gets from one word to the next by changing exactly one bit. The author discusses Gray codes and applies them in particular of humanizing the algorithm for the Towers of Hanoi.

Recommendations

• Towers of Hanoi -- where programming techniques blend
• scientific article; zbMATH DE number 5728684
• scientific article; zbMATH DE number 1028239
• Recursive functions: An archeological look
• The representation of permutations by trees

Cited in

(2)

• Linear differential equations as a data structure
• Towers of Hanoi -- where programming techniques blend

This page was built for publication:

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