𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof of the decidability of bisimulation for normed bpa-processes

✍ Scribed by Jan Friso Groote

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
388 KB
Volume
42
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof of the degree bound for in
A short proof of the degree bound for interval number
✍ Douglas B. West πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 141 KB

A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 in

A short proof of a partition theorem for
A short proof of a partition theorem for the ordinal ωω
✍ Jean A. Larson πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science βš– 716 KB

An ordinal a is equal to the set of its predecessors and is ordered by the membership relation. For any ordinal a, one writes a -~ (a, m) 2 if and only if for any set A order-isomorphic to a, and any function f from the pairs of elements of A into {0, 1}, either there is a subset X c\_ A order-isomo