Computer Science – Formal Languages and Automata Theory
Scientific paper
2012-01-05
Computer Science
Formal Languages and Automata Theory
Scientific paper
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.
No associations
LandOfFree
An Entertaining Example of Using the Concepts of Context-Free Grammar and Pushdown Automation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Entertaining Example of Using the Concepts of Context-Free Grammar and Pushdown Automation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Entertaining Example of Using the Concepts of Context-Free Grammar and Pushdown Automation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-609421