✦ LIBER ✦

Regular algebra of functionals of labeled trees

✍ Scribed by L. P. Lisovik

Publisher: Springer US
Year: 1986
Tongue: English
Weight: 741 KB
Volume: 21
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01074712

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognition of perfect labeled trees wit

Recognition of perfect labeled trees with regularity condition

✍ L. P. Lisovik 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 167 KB

Algebra of regular Petri nets

✍ V. E. Kotov 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 897 KB

Congruence preserving functions of Wilke

Congruence preserving functions of Wilke’s tree algebras

✍ Saeed Salehi 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 643 KB

Additive functionals of regular semi-Mar

Additive functionals of regular semi-Markov processes

✍ A. P. Cherenkov 📂 Article 📅 1975 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 383 KB

Poisson approximations for functionals o

Poisson approximations for functionals of random trees

✍ Robert P. Dobrow; Robert T. Smythe 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 543 KB

We use Poisson approximation techniques for sums of indicator random variables to derive explicit error bounds and central limit theorems for several functionals of random trees. In particular, we consider (i) the number of comparisons for successful and unsuccessful search in a binary search tree a

Number of labeled 4-regular graphs

✍ R. C. Read; N. C. Wormald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

## Abstract Several operations on 4‐regular graphs and pseudographs are analyzed and equations are obtained relating the numbers of these graphs on given numbers of labeled points. These equations are used recursively to find the numbers of 4‐regular graphs on up to 13 labeled points.