Conferences in DBLP
P. Stanley Peters Jr. , Robert W. Ritchie Context-Sensitive Immediate Constituent Analysis-Context-Free Languages Revisited [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:1-8 [Conf ] Gene F. Rose Abstract Families of Processors [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:9-14 [Conf ] Ronald V. Book , Sheila A. Greibach Quasi-Realtime Languages-Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:15-18 [Conf ] Joseph S. Ullian The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:19-20 [Conf ] W. J. Chandler Abstract Families of Deterministic Languages [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:21-30 [Conf ] William F. Ogden Intercalation Theorems for Stack Languages [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:31-42 [Conf ] Manuel Blum On Effective Procedures for Speeding Up Algorithms [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:43-53 [Conf ] Sanat K. Basu On Classes of Computable Functions [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:55-59 [Conf ] Donald W. Loveland On Minimal-Program Complexity Measures [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:61-65 [Conf ] Allan Borodin Complexity Classes of Recursive Functions and the Existence of Complexity Gaps [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:67-78 [Conf ] Edward M. McCreight , Albert R. Meyer Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:79-88 [Conf ] Paul R. Young Speed-Ups by Changing the Order in Which Sets are Enumerated (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:89-92 [Conf ] Alfred V. Aho , Jeffrey D. Ullman Translations on a Context Free Grammar [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:93-112 [Conf ] Peter Johansen Free Groups and Regular Expressions [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:113-128 [Conf ] James W. Thatcher Transformations and Translations from the Point of View of Generalized Finite Automata Theory [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:129-142 [Conf ] William C. Rounds Context-Free Grammars on Trees [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:143-148 [Conf ] Gabor T. Herman , Stephen D. Isard Computability over Arbitrary Fields [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:149-153 [Conf ] C. D. Shepard Languages in General Algebras [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:155-163 [Conf ] Daniel J. Rosenkrantz , Richard Edwin Stearns Properties of Deterministic Top Down Grammars [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:165-180 [Conf ] Michael J. Fischer Some Properties of Precedence Languages [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:181-190 [Conf ] A. J. Korenjak Efficient LR(1) Processor Construction [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:191-200 [Conf ] Zohar Manna , Amir Pnueli Formalization of Properties of Recursively Defined Functions [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:201-210 [Conf ] H. Paul Zeiger Formal Models for Some Features of Programming Languages [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:211-215 [Conf ] Edward K. Blum Towards a Theory of Semantics and Compilers for Programming Languages [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:217-227 [Conf ] Stephen A. Cook Variations on Pushdown Machines (Detailed Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:229-231 [Conf ] Stephen N. Cole Pushdown Store Machines and Real-Time Computation [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:233-245 [Conf ] Walter J. Savitch Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:247-248 [Conf ] Louis Hodes The Logical Complexity of Geometric Properties in the Plane [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:249-254 [Conf ] Algirdas Avizienis On the Problem of Computational Time and Complexity of Arithmetic Functions [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:255-258 [Conf ] Serafino Amoroso , Edward Lieblein , Hisao Yamada A Unifying Framework for the Theory of Iterative Arrays of Machines [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:259-269 [Conf ] Philip M. Spira On the Computation Time of Certain Classes of Boolean Functions [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:271-272 [Conf ]