J.-P. Allouche and F. Dress. Tours de Hano? et automates. Informatique théorique et applications, 24(1):1{15, 1990. (in French).

has been cited by the following article:

• TITLE: An Entertaining Example of Using the Concepts of Context-Free Grammar and Pushdown Automation

  AUTHORS: Krasimir Yordzhev

  KEYWORDS: Context-Free Grammar; Context-Free Language; Pushdown Automation; Hanoi towers; Discrete Mathematics Learning

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.3, July 18, 2012

  ABSTRACT: A formal-linguistic approach for solving an entertaining task is offered in this paper. The well-known task of the Hanoi towers is discussed in relation to some concepts of formal languages and grammars. A context-free grammar which generates an algorithm for solving this task is described. A deterministic pushdown automation which in its work imitates the work of monks in solving the task of the Hanoi towers is built.