default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. CAAP 1984
- Bruno Courcelle:
CAAP'84, 9th Colloquium on Trees in Algebra and Programming, Bordeaux, France, March 5-7, 1984, Proceedings. Cambridge University Press 1984, ISBN 0-521-26750-1 - Giuseppe Longo:
Continuous Structures and Analytic Methods in Computer Science. CAAP 1984: 1-22 - Kurt Mehlhorn:
On Optimal VLSI-Circuits for the Basic Arithmetic Functions. CAAP 1984: 23-30 - Wolfgang Thomas:
Logical Aspects in the Study of Tree Languages. CAAP 1984: 31-50 - Didier Arquès, Jean Françon:
Arbres Bien Etiquetes et Fractions Multicontinues. CAAP 1984: 51-62 - Ronald I. Becker, Stephen R. Schach:
A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees. CAAP 1984: 63-72 - Jean-Pierre Braquelaire:
Graphs and Rational Expressions Denoting Regular Trees. CAAP 1984: 73-92 - Nachum Dershowitz, Shmuel Zaks:
Patterns in Trees. CAAP 1984: 93-102 - Joost Engelfriet, Heiko Vogler:
Regular Characterizations of Macro Tree Transducers. CAAP 1984: 103-118 - Jean Françon, Claude Puech:
Histoires de Files de Priorite avec Fusions. CAAP 1984: 119-138 - Martin Gogolla:
Partially Ordered Sorts in Algebraic Specifications. CAAP 1984: 139-154 - A. Kanda:
Numeration Models of Lambda-Calculus. CAAP 1984: 155-168 - Michael Kaufmann:
Nearly Tight Bounds for the Longest Edge in an Tree in a VLSI Lay Out. CAAP 1984: 169-180 - Pierre Lescanne:
Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. CAAP 1984: 181-194 - Satoru Miyano, Takeshi Hayashi:
Alternating Finite Automata on omega-Words. CAAP 1984: 195-210 - E. Paul:
Proofs by Inducting in Equational Theories with Relations Between Constructors. CAAP 1984: 211-226 - Laurence Puel:
Proofs in the Final Algebra. CAAP 1984: 227-242 - Jean-Claude Raoult:
On Graph Rewritings. CAAP 1984: 243-256 - Grzegorz Rozenberg, Emo Welzl:
Boundary NLC Grammars. CAAP 1984: 257-270 - M. Soria, Jean-Marc Steyaert:
Average Efficiency of Pattern Matching on LISP Expressions. CAAP 1984: 271-282 - K. Theobald:
A Theory of Representable Cpo's. CAAP 1984: 283-298 - E. Timmermann:
Yields of Infinite Trees. CAAP 1984: 299-312 - Ingo Wegener:
Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. CAAP 1984: 313-325
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-11-27 20:31 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:
