CAAP '90 : 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15 18, 1990 : proceedings
This volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming. The papers selected present new research results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including th...
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
431 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 1990, proceedings, 1990, Berlin, Springer, 1 vol. (VI-284 p.), Lecture notes in computer science, 0-387-52590-4 • CAAP '90, Texte imprimé, 9783662165430 |
目次:
- On the power of bounded concurrency II: The pushdown automata level
- Trees everywhere
- Combinatory forms for equational programming: Instances, unification and narrowing
- Graphical versus logical specifications
- More efficient bottom-up tree pattern matching
- On the regular structure of prefix rewriting
- A unified approach for showing language containment and equivalence between various types of ?-automata
- Unitary monoid with two generators: An algorithmic point of view
- Coherence of subsumption
- Petri nets as models of linear logic
- Towards the unification of models for concurrency
- A markovian concurrency measure
- Graph matching in operational semantics and typing
- ML typability is dexptime-complete
- Testing for inductiue (co)-reducibility
- Probabilistic analysis of some distributed algorithms
- Infinite values in hierarchical imperative types
- Equivalence of finite-valued bottom-up finite state tree transducers is decidable.