An Entertaining Example of Using the Concepts of Context-Free Grammar and Pushdown Automation
Krasimir Yordzhev
TL;DR
This paper presents a formal linguistic approach to the Tower of Hanoi problem, using context-free grammar and pushdown automaton to model and solve the task in an entertaining and educational manner.
Contribution
It introduces a novel application of context-free grammar and pushdown automaton to model the Tower of Hanoi problem, linking formal language theory with algorithmic solutions.
Findings
The grammar generates an algorithm for solving Tower of Hanoi.
A pushdown automaton mimics the problem-solving process.
The approach provides an educational perspective on formal languages.
Abstract
A formal-linguistic approach for solving an entertaining task is made in this paper. The well-known task of the Hanoi towers is discussed in relation to some concepts of discrete mathematics. A context-free grammar which generate 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.