Programming Language for Automata

Authors:
Donald E. Knuth;Richard H. Bigelow
Affiliations:
California Institute of Technology, Pasadena, California;California Institute of Technology, Pasadena, California
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 4
Cited 9

A Turing Machine Simulator

Journal of the ACM (JACM)
Backtrack Programming

Journal of the ACM (JACM)
Stack automata and compiling

Journal of the ACM (JACM)
Report on the algorithmic language ALGOL 60

Communications of the ACM

Nested Stack Automata

Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Formal models for some features of programming languages

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Variations on pushdown machines (Detailed Abstract)

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Two results concerning the power of two-way deterministic Pushdown Automata

ACM '73 Proceedings of the ACM annual conference
Microprogram Transformations

IEEE Transactions on Computers
System Description Languages

IEEE Transactions on Computers
Abstract families of length-preserving processors

Journal of Computer and System Sciences
Fifty years of automata simulation: a review

ACM Inroads

Quantified Score

Hi-index	0.01

Visualization

Abstract

The techniques of automatic programming are useful for constructive proofs in automata theory. A formal definition of an elementary programming language for a stack automaton is given, and it is shown how this may be readily adapted to other classes of automata. The second part of this paper shows how this programming language can be applied to automata theory, as we prove there are non-context-sensitive languages accepted by a stack automaton.