default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st ICALP 1972: Paris, France
- Maurice Nivat:
Automata, Languages and Programming, Colloquium, Paris, France, July 3-7, 1972. North-Holland, Amsterdam 1972, ISBN 0-7204-2074-1 - Philippe Butzbach:
Une famille de congruences de Thue pour lesquelles le problème de l'équivalence est décidable. Application á l'équivalence des grammaires séparées. ICALP 1972: 3-12 - Christian Choffrut:
Transducteurs conservant l'imprimitivité du langage d'entrée. ICALP 1972: 13-29 - Robert Cori:
Sur des langages vérifiant des équations avec opérateur. ICALP 1972: 31-43 - Frederick A. Hosch, Lawrence H. Landweber:
Finite Delay Solutions for Sequential Conditions. ICALP 1972: 45-60 - Rudolf E. Kálmán:
Realization Theory of Linear Systems over a Commutative Ring. ICALP 1972: 61-65 - André Lentin:
Equations in Free Monoids. ICALP 1972: 67-85 - Matti Linna:
Finite Power Property of Regular Languages. ICALP 1972: 87-98 - Azaria Paz, Michael Rabinovich:
Linear Automata - Approximation Problem (Extended Abstract). ICALP 1972: 99-102 - Marcel Paul Schützenberger:
A propos du relation rationelles fonctionnelles. ICALP 1972: 103-114 - Guy Vidal-Naquet:
Quelques applications des automates à arbres infinis. ICALP 1972: 115-122 - Gérard Viennot:
Automates et bascules. ICALP 1972: 123-133 - Yechezkel Zalcstein:
Syntactic Semigroups of Some Classes of Star-Free Languages. ICALP 1972: 135-144 - Gianni Aguzzi, Renzo Pinzani, Renzo Sprugnoli:
An Algorithmic Approach to the Semantics of Programming Languages. ICALP 1972: 147-166 - J. W. de Bakker, Willem P. de Roever:
A Calculus for Recursive Program Schemes. ICALP 1972: 167-196 - Corrado Böhm, Mariangiola Dezani-Ciancaglini:
Can Syntax Be Ignored during Translation? ICALP 1972: 197-207 - Volker Claus:
Assignment-Programs. ICALP 1972: 209-214 - Joost Engelfriet:
Translation of Simple Program Schemes. ICALP 1972: 215-223 - Peter Hitchcock, David Michael Ritchie Park:
Induction Rules and Termination Proofs. ICALP 1972: 225-251 - Denis J. Kfoury:
Comparing Algebraic Structures up to Algorithmic Equivalence. ICALP 1972: 253-263 - Jean Kott:
Remarques sur la structure des schémas de programmes. ICALP 1972: 265-271 - Zohar Manna, Jean Vuillemin:
Fixpoint Approach to the Theory of Computation. ICALP 1972: 273-291 - Maurice Nivat:
Langages algébriques sur le magma libre et sémantique des schémas de programme. ICALP 1972: 293-308 - Louis Nolin:
Systèmes algorithmiques, systèmes fonctionnels. ICALP 1972: 309-318 - Gilles Ruggiu:
Les types et les appels de procédures. ICALP 1972: 319-330 - Mitchell Wand:
A Concrete Approach to Abstract Recursion Definitions. ICALP 1972: 331-341 - Jean Berstel:
Sur la densité asymptotique de langages formels. ICALP 1972: 345-358 - Luc Boasson:
Un critère de rationnalité des langages algébriques. ICALP 1972: 359-365 - Stefano Crespi-Reghizzi:
Approximation of Phrase Markers by Regular Sets. ICALP 1972: 367-376 - J. P. Crestin:
Un langage non ambigu dont le carré est d'ambiguité non bornée. ICALP 1972: 377-390 - Peter van Emde Boas:
A Comparison of the Properties of Complexity Classes and Honesty Classes. ICALP 1972: 391-396 - Michel Fliess:
Automates stochastiques et séries rationnelles non commutatives. ICALP 1972: 397-411 - Michael A. Harrison, Ivan M. Havel:
On a Family of Deterministic Grammars (Extended Abstract). ICALP 1972: 413-441 - Pei Hsia, Raymond T. Yeh:
Finite Automata with Markers. ICALP 1972: 443-451 - Aravind K. Joshi, Leon S. Levy, Masako Takahashi:
A Tree Generating System. ICALP 1972: 453-465 - S.-Y. Kuroda:
On Structural Similarity of Phrase-Structure Languages. ICALP 1972: 467-474 - Masako Takahashi:
Primitive Tranformations of Regular Sets and Recognizable Sets. ICALP 1972: 475-480 - Gabriel Thierrin:
Convex Languages. ICALP 1972: 481-492 - Stephen F. Weiss, Gyula Magó, Donald F. Stanat:
Algebraic Parsing Techniques for Context-Free Languages. ICALP 1972: 493-498 - Brenda S. Baker:
Context-Sensitive Grammars Generating Context-Free Languages. ICALP 1972: 501-506 - Alberto Bertoni:
Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines. ICALP 1972: 507-516 - Ronald V. Book:
Complexity Classes of Formal Languages (Extended Abstract). ICALP 1972: 517-520 - Alex Dubinsky:
The Functions Computed by a Monadic Program Schema with One Location. ICALP 1972: 521-535 - Philippe Flajolet, Jean-Marc Steyaert:
Complexité des problèmes de décision relatifs aux algorithmes de tri. ICALP 1972: 537-548 - Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch:
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. ICALP 1972: 549-561 - Rainer Kemp:
An Estimation of the Set of States of the Minimal LR(0)-Acceptor. ICALP 1972: 563-574 - Burkhard Monien:
Relationship between Pushdown Automata and Tape-Bounded Turing Machines. ICALP 1972: 575-583 - Claus-Peter Schnorr:
Does the Computational Speed-up Concern Programming? ICALP 1972: 585-591 - R. Turner:
An Infinite Hierarchy of Term Languages - An Approach to Mathematical Complexity. ICALP 1972: 593-608 - Bostjan Vilfan:
A Generalization of a Theorem of Specker and Some Applications. ICALP 1972: 609-622
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
