ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Deterministic Pushdown Store Machines and Real-Time Computation
Full text PdfPdf (1.41 MB)
Source Journal of the ACM (JACM) archive
Volume 18 ,  Issue 2  (April 1971) table of contents
Pages: 306 - 328  
Year of Publication: 1971
ISSN:0004-5411
Author
Stephen N. Cole  IBM Federal Systems Division, Owego, New York
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 1
Additional Information:

references   cited by   index terms   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321637.321649
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
COLE, S.N. Real-time computation by iterative arrays of finite-state machines. Doctoral Diss. Harvard U., Cambridge, Mass., Aug. 1964.
 
2
COLE, S. N. Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. C-18, 4 (Apr. 1969), 349-365. Also, IEEE Conf. Record 1966 Seventh Ann. Symp: on Switching and Automata Theory, Oct. 1966.
 
3
DAVIS, MARTIN. Computability and Unsolvability, McGraw-Hill, New York, 1958.
 
4
FISCHER, P. C. Turing machines with restricted memory access. Inform. Contr. 9, 4 (Aug. 1966)~ 364-379.
 
5
GINSBURG, S., AND GREIBACH, S. Deterministic context-free languages. Inform. Contr. 9, 6 (Dec. 1966), 620-648.
6
Sheila A. Greibach, A New Normal-Form Theorem for Context-Free Phrase Structure Grammars, Journal of the ACM (JACM), v.12 n.1, p.42-52, Jan. 1965  [doi>10.1145/321250.321254]
 
7
OGDEN, W.F. Intercalation theorems for pushdown store and stack languages. Doctoral Diss., Stanford U., Palo Alto, Calif., Dec. 1968.
 
8
RABIN, M. 0., AND SCOTT,' D. Finite automata and their decision problems. IBM J. Res. and Development 3, 2 (Apr. 1959), 114-125.
 
9
RABIN, M.O. Real-time computation and recursive functions not real-time computable. Israel J. Math. 1, 4 (Dec. 1963), 203-211.
 
10
STEARNS, R.E. "A regularity test for pushdown store machines. Inform. Contr. 11, 3 (Sept. 1967), 323-340.

CITED BY
Patrick C. Fischer, Theory of computing in computer science education, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

Additional Classification:
  C. Computer Systems Organization
  C.3 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS
      Subjects: Real-time and embedded systems


General Terms:
Languages, Measurement, Performance, Theory, Verification


Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player