The Complexity of Finite Memory Programs with Recursion

Authors:
Neil D. Jones;Steven S. Muchnick
Affiliations:
Department of Computer Science, The University of Kansas, Lawrence, KS and University of Aarhus, Denmark;Department of Computer Science, The University of Kansas, Lawrence, KS
Venue:
Journal of the ACM (JACM)
Year:
1978

Citing 6
Cited 4

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
A Formalization of Transition Diagram Systems

Journal of the ACM (JACM)
Even Simple Programs Are Hard To Analyze

Journal of the ACM (JACM)
Revised report on the algorithm language ALGOL 60

Communications of the ACM
Computation: finite and infinite machines

Computation: finite and infinite machines
Formal languages and their relation to automata

Formal languages and their relation to automata

Decidable problems for powerful programs

Journal of the ACM (JACM)
Preface

The essence of computation
Hierarchies of infinite structures generated by pushdown automata and recursion schemes

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
An observationally complete program logic for imperative higher-order functions

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract