Donald E. Knuth
Richard H. Bigelow
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.
- 1 GINSBURG, SEYMOUR, GREIBACg, SIELA A., AND HARRISON, MICAE A. Stack automata and compiling. J. ACM I (1967), 172-201. Google Scholar
- 2 CURTIS, M. W. A Turing machine simulator, J, ACM 12 (1965), 1-13 Google Scholar
- 3 NAUR, PETER, Ed. Report on the Algorithmic Langmge ALGOL 60. Comm. ACM 3 (1960), 299-314. Google Scholar
- 4 KURODA, S. Y. Classes of lauguages and linear bounded automata. Inf. Coat. 7 (1964), 202-223.Google Scholar
- 5 CAINE, STEPHEN H. Reference manual for CIT 7090/7094 experimental macro assembly program (XMAP). California Institute of "Ichnology, Pasadena, Calif. April 2,4, 1964.Google Scholar
- 6 GOLOMB, SOLOMON W., AND BAUMERT, LEONARD :D. Backtrack Programming. J. ACM 12 (1965), 516-524. Google Scholar
Index Terms
- Programming Language for Automata
Recommendations
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 ...
Non-regular unary language and parallel communicating WatsonCrick automata systems
In 2006, Czeizler et al. introduced parallel communicating WatsonCrick automata system. They showed that parallel communicating WatsonCrick automata system can accept the non-regular unary language L={an2,wheren>1} using non-injective complementarity ...
Comments