Affiliation:
1. The Queen's Univ., Belfast, Northern Ireland
Abstract
Introductory courses in Theory of Computation usually include a study of abstract machines such as finite state machines and Turing machines. This paper demonstrates that a neat and useful way of presenting these automata is to use a logic programming language such as Prolog, making the approach useful from a teaching point of view. Not only does a Prolog specification provide a precise definition of an automoton's behaviour, but it also gives an immediately-executable simulator. The reversible execution property of Prolog programs can make these simulators inherently more powerful than traditional simulators. The paper includes Prolog specifications for finite state machines, Turing machines, linear bounded automata, and pushdown automata.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. Minsky M .L . "Computation : finite an d infinite machines" Prentice-Hall Inc . Englewood Cliffs N .J . (1967) .
2. Hopkin D . and Moss B . "Automata" Macmillan London (1976) .
3. Kain R .Y . "Automata theory : machines an d languages" McGraw-Hill Inc . London (1972) .
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献