Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Programming Language for Automata

Programming Language for Automata Programming Languages for Automata DONALD E . K i ~ U T H * AND RICHARD H. B I G E L O ~ V California Institute of Technology, Pasadena, California ABSTRACT. The techniques of a u t o m a t i c p r o g r a m m i n g are useful for constructive proofs in a u t o m a t a theory. A formal definition of an e l e m e n t a r y programming language for a stack automaton is given, and it is shown how this m a y be readily a d a p t e d to other classes of a u t o m a t a . The second p a r t of this p a p e r shows how this programming language can be applied to automata theory, as we prove there are non-c0ntext-sensitive languages accepted by a stack automaton. Research connected with automata generally is aimed at proving two different kinds of theorems: (a) that a certain class of automata is capable of doing a certain job; or (b) that a certain class of automata is not http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

Programming Language for Automata

Download PDF
21 pages

Loading next page...
 
/lp/association-for-computing-machinery/programming-language-for-automata-DPGCBwD0ga

References (12)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1967 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/321420.321421
Publisher site
See Article on Publisher Site

Abstract

Programming Languages for Automata DONALD E . K i ~ U T H * AND RICHARD H. B I G E L O ~ V California Institute of Technology, Pasadena, California ABSTRACT. The techniques of a u t o m a t i c p r o g r a m m i n g are useful for constructive proofs in a u t o m a t a theory. A formal definition of an e l e m e n t a r y programming language for a stack automaton is given, and it is shown how this m a y be readily a d a p t e d to other classes of a u t o m a t a . The second p a r t of this p a p e r shows how this programming language can be applied to automata theory, as we prove there are non-c0ntext-sensitive languages accepted by a stack automaton. Research connected with automata generally is aimed at proving two different kinds of theorems: (a) that a certain class of automata is capable of doing a certain job; or (b) that a certain class of automata is not

Journal

Journal of the ACM (JACM) – Association for Computing Machinery

Published: Oct 1, 1967

There are no references for this article.