𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for constructing a tree automaton recognizing a congruential tree language

✍ Scribed by Sándor Vágvölgyi

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
547 KB
Volume
115
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time algorithm recognizing
A polynomial time algorithm recognizing link trees
✍ Peter Bugata; Attila Nagy; Roman Vávra 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 672 KB

The link of a vertex u of a graph G is the subgraph induced by all vertices adjacent to u . If all the links of G are isomorphic to a finite graph L, then G is called a realization of L, and L is called a link graph. At the Smolenice symposium of 1963, Zykov posed the problem of recognizing iink gr