Conferences in DBLP
Adriaan van Wijngaarden The Generative Power of Two-Level Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Jan van Leeuwen A Generalisation of Parikh's Theorem in Formal Language Theory. [Citation Graph (0, 0)][DBLP ] Conf ] E. Shamir , Catriel Beeri Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Willem P. de Roever Recursion and Parameter Mechanisms: An Axiomatic Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Martelli , Ugo Montanari Dynamic Programming Schemata. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio De Michelis , Carla Simone Semantic Characterization of Flow Diagrams and Their Decomposability. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Kandzia On the Most Recent Property of Algol-Like Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques J. Arsac Langages sans Etiquettes et Transformations de Programmes. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Ausiello Relations between Semantics and Complexity of Recursive Programs. [Citation Graph (0, 0)][DBLP ] Conf ] John C. Reynolds On the Relation between Direct and Continuation Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Giuliano Pacini , Carlo Montangero , Franco Turini Graph Representation and Computation Rules for Typeless Recursive Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Mariangiola Dezani-Ciancaglini , Maddalena Zacchi Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Corrado Böhm , Mariangiola Dezani-Ciancaglini Combinatorial Problems, Combinator Equations and Normal Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle , Gilles Kahn , Jean Vuillemin Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples. [Citation Graph (1, 0)][DBLP ] Conf ] David B. Lomet Automatic Generation of Multiple Exit Parsing Subroutines. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew M. Geller , Susan L. Graham , Michael A. Harrison Production Prefix Parsing (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David Pager On Eliminating Unit Productions from LR(k) Parsers. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Lang Deterministic Techniques for Efficient Non-Deterministic Parsers. [Citation Graph (0, 0)][DBLP ] Conf ] Witold Lipski Jr. , V. Wiktor Marek File Organization, An Application of Graph Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Burkhard Monien Characterizations of Time-Bounded Computations by Limited Primitive Recursion. [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr On Maximal Merging of Information in Boolean Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis , Theodore P. Baker On Simple Goedel Numberings and Translations. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn The "Almost All" Theory of Subrecursive Degrees is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Weihrauch The Compuational Complexity of Program Schemata. [Citation Graph (0, 0)][DBLP ] Conf ] Max Fontet Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Césari Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnets complets. [Citation Graph (0, 0)][DBLP ] Conf ] Ferenc Gécseg Composition of Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Armin B. Cremers , Seymour Ginsburg Context-Free Grammar Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Berstel , Luc Boasson Une suite decroissante de cônes rationnels. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Hotz Komplexitätsmaße für Ausdrücke. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick C. Fischer , Robert L. Probert Efficient Procedures for Using Matrix Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick C. Fischer Further Schemes for Combining Matrix Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book On the Structure of Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Jean-Marc Steyaert On Sets Having Only Hard Subsets. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhold Weicker Turing Machines with Associative Memory Access. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Ehrenfeucht , Grzegorz Rozenberg Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslav Novotný Operators Reducing Generalized OL-Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II , T. S. E. Maibaum Parallel Rewriting Systems on terms. [Citation Graph (0, 0)][DBLP ] Conf ] Meera Blattner Transductions of Context-Free Languages into Sets of Sentential Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Arto Salomaa Parallelism in Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Rainer Kemp Mehrdeutigkeiten Kontextfreier Grammatiken. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Dilger , Peter Raulefs Monadic Program Schemes Under Restricted Classes of Free Interpretations. [Citation Graph (0, 0)][DBLP ] Conf ] Ashok K. Chandra Generalized Program Schemas. [Citation Graph (0, 0)][DBLP ] Conf ] Eberhard Bertsch A Decidability Result for Sequential Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Antoni Kreczmar Effectivity Problems of Algorithmic Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick J. Hayes Simple and Structural Redundancy in Non-Deterministic Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Marcel Paul Schützenberger Sur une propriete syntactique des relations rationnelles. [Citation Graph (0, 0)][DBLP ] Conf ] 