Abstract
This paper discusses a practical programming language specially designed to aid teachers and students of Computer Science courses which deal with mathematical machines. The first section outlines the motivation for developing such a language in the Computer Science curriculum. Next the criteria which were used to design the language are listed. The characteristics of <u>Automata</u>, the interpreter of this language, are discussed next. Concluding remarks note the results of using <u>Automata</u> as a teaching aid in three Computer Science courses at the Pennsylvania State University. The User's Guide to <u>Automata</u> is attached as the Appendix.
Index Terms
(auto-classified)Automata: a teaching aid for mathematical machines
Recommendations
Flip-pushdown automata: nondeterminism is better than determinism
DLT'03: Proceedings of the 7th international conference on Developments in language theoryFlip-pushdown automata are pushdown automata with the additional ability to flip or reverse its pushdown. We investigate deterministic and nondeterministic flip-pushdown automata accepting by final state or empty pushdown. In particular, for ...
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...






Comments