The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
1972 (conf/icalp/72)

  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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:3-12 [Conf]
  2. Christian Choffrut
    Transducteurs conservant l'imprimitivité du langage d'entrée. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:13-29 [Conf]
  3. Robert Cori
    Sur des langages vérifiant des équations avec opérateur. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:31-43 [Conf]
  4. Frederick A. Hosch, Lawrence H. Landweber
    Finite Delay Solutions for Sequential Conditions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:45-60 [Conf]
  5. R. E. Kalman
    Realization Theory of Linear Systems over a Commutative Ring. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:61-65 [Conf]
  6. A. Lentin
    Equations in Free Monoids. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:67-85 [Conf]
  7. Matti Linna
    Finite Power Property of Regular Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:87-98 [Conf]
  8. Azaria Paz, Michael Rabinovich
    Linear Automata - Approximation Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:99-102 [Conf]
  9. Marcel Paul Schützenberger
    A propos du relation rationelles fonctionnelles. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:103-114 [Conf]
  10. Guy Vidal-Naquet
    Quelques applications des automates à arbres infinis. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:115-122 [Conf]
  11. Gérard Viennot
    Automates et bascules. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:123-133 [Conf]
  12. Yechezkel Zalcstein
    Syntactic Semigroups of Some Classes of Star-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:135-144 [Conf]
  13. Gianni Aguzzi, Renzo Pinzani, Renzo Sprugnoli
    An Algorithmic Approach to the Semantics of Programming Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:147-166 [Conf]
  14. J. W. de Bakker, Willem P. de Roever
    A Calculus for Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:167-196 [Conf]
  15. Corrado Böhm
    Can Syntax Be Ignored during Translation? [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:197-207 [Conf]
  16. Volker Claus
    Assignment-Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:209-214 [Conf]
  17. Joost Engelfriet
    Translation of Simple Program Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:215-223 [Conf]
  18. Peter Hitchcock, David Park
    Induction Rules and Termination Proofs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:225-251 [Conf]
  19. Denis J. Kfoury
    Comparing Algebraic Structures up to Algorithmic Equivalence. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:253-263 [Conf]
  20. Jean Kott
    Remarques sur la structure des schémas de programmes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:265-271 [Conf]
  21. Zohar Manna, Jean Vuillemin
    Fixpoint Approach to the Theory of Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:273-291 [Conf]
  22. Maurice Nivat
    Langages algébriques sur le magma libre et sémantique des schémas de programme. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:293-308 [Conf]
  23. Louis Nolin
    Systèmes algorithmiques, systèmes fonctionnels. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:309-318 [Conf]
  24. Gilles Ruggiu
    Les types et les appels de procédures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:319-330 [Conf]
  25. Mitchell Wand
    A Concrete Approach to Abstract Recursion Definitions. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:331-341 [Conf]
  26. Jean Berstel
    Sur la densité asymptotique de langages formels. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:345-358 [Conf]
  27. Luc Boasson
    Un critère de rationnalité des langages algébriques. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:359-365 [Conf]
  28. Stefano Crespi-Reghizzi
    Approximation of Phrase Markers by Regular Sets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:367-376 [Conf]
  29. J. P. Crestin
    Un langage non ambigu dont le carré est d'ambiguité non bornée. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:377-390 [Conf]
  30. Peter van Emde Boas
    A Comparison of the Properties of Complexity Classes and Honesty Classes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:391-396 [Conf]
  31. Michel Fliess
    Automates stochastiques et séries rationnelles non commutatives. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:397-411 [Conf]
  32. Michael A. Harrison, Ivan M. Havel
    On a Family of Deterministic Grammars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:413-441 [Conf]
  33. Pei Hsia, Raymond T. Yeh
    Finite Automata with Markers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:443-451 [Conf]
  34. Aravind K. Joshi, Leon S. Levy, Masako Takahashi
    A Tree Generating System. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:453-465 [Conf]
  35. S.-Y. Kuroda
    On Structural Similarity of Phrase-Structure Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:467-474 [Conf]
  36. Masako Takahashi
    Primitive Tranformations of Regular Sets and Recognizable Sets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:475-480 [Conf]
  37. Gabriel Thierrin
    Convex Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:481-492 [Conf]
  38. Stephen F. Weiss, Gyula Magó, Donald F. Stanat
    Algebraic Parsing Techniques for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:493-498 [Conf]
  39. Brenda S. Baker
    Context-Sensitive Grammars Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:501-506 [Conf]
  40. Alberto Bertoni
    Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:507-516 [Conf]
  41. Ronald V. Book
    Complexity Classes of Formal Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:517-520 [Conf]
  42. Alex Dubinsky
    The Functions Computed by a Monadic Program Schema with One Location. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:521-535 [Conf]
  43. Philippe Flajolet, Jean-Marc Steyaert
    Complexité des problèmes de décision relatifs aux algorithmes de tri. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:537-548 [Conf]
  44. Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch
    Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:549-561 [Conf]
  45. Rainer Kemp
    An Estimation of the Set of States of the Minimal LR(0)-Acceptor. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:563-574 [Conf]
  46. Burkhard Monien
    Relationship between Pushdown Automata and Tape-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:575-583 [Conf]
  47. Claus-Peter Schnorr
    Does the Computational Speed-up Concern Programming? [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:585-591 [Conf]
  48. R. Turner
    An Infinite Hierarchy of Term Languages - An Approach to Mathematical Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:593-608 [Conf]
  49. Bostjan Vilfan
    A Generalization of a Theorem of Specker and Some Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:609-622 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002