↓ Skip to main content
What is this page? Embed badge

CAAP '90

Overview of attention for book
Cover of 'CAAP '90'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 37 On the power of bounded concurrency II: The pushdown automata level
  3. Altmetric Badge
    Chapter 38 Trees everywhere
  4. Altmetric Badge
    Chapter 39 Combinatory forms for equational programming: Instances, unification and narrowing
  5. Altmetric Badge
    Chapter 40 Graphical versus logical specifications
  6. Altmetric Badge
    Chapter 41 More efficient bottom-up tree pattern matching
  7. Altmetric Badge
    Chapter 42 On the regular structure of prefix rewriting
  8. Altmetric Badge
    Chapter 43 A unified approach for showing language containment and equivalence between various types of ω-automata
  9. Altmetric Badge
    Chapter 44 Unitary monoid with two generators: An algorithmic point of view
  10. Altmetric Badge
    Chapter 45 Coherence of subsumption
  11. Altmetric Badge
    Chapter 46 Petri nets as models of linear logic
  12. Altmetric Badge
    Chapter 47 Towards the unification of models for concurrency
  13. Altmetric Badge
    Chapter 48 A markovian concurrency measure
  14. Altmetric Badge
    Chapter 49 Graph matching in operational semantics and typing
  15. Altmetric Badge
    Chapter 50 ML typability is dexptime-complete
  16. Altmetric Badge
    Chapter 51 Testing for inductiue (co)-reducibility
  17. Altmetric Badge
    Chapter 52 Probabilistic analysis of some distributed algorithms
  18. Altmetric Badge
    Chapter 53 Infinite values in hierarchical imperative types
  19. Altmetric Badge
    Chapter 54 Equivalence of finite-valued bottom-up finite state tree transducers is decidable
Attention for Chapter 54: Equivalence of finite-valued bottom-up finite state tree transducers is decidable
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Equivalence of finite-valued bottom-up finite state tree transducers is decidable
Chapter number 54
Book title
CAAP '90
Published by
Springer Berlin Heidelberg, January 1990
DOI 10.1007/3-540-52590-4_54
Book ISBNs
978-3-54-052590-5, 978-3-54-047042-7
Authors

Helmut Seidl

Editors

A. Arnold

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 100%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.