✦ LIBER ✦

On process languages in finite graphs

✍ Scribed by K. V. Shakhbazyan; Y. H. Shoukourian

Book ID: 110612079
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 613 KB
Volume: 101
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf02672777

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite Languages for the Representation

Finite Languages for the Representation of Finite Graphs

✍ Andrzej Ehrenfeucht; Joost Engelfriet; Grzegorz Rozenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We introduce a new way of specifying graphs: through languages, i.e., sets of strings. The strings of a given (finite, prefix-free) language represent the vertices of the graph; whether or not there is an edge between the vertices represented by two strings is determined by the pair of symbols at th

Finite graph-acceptors and regular graph

Finite graph-acceptors and regular graph-languages

✍ Kurt-Ulrich Witt 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 595 KB

Regular languages with variables on grap

Regular languages with variables on graphs

✍ Simone Santini 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 345 KB

On predecessors of finite languages

✍ Hermann A. Maurer; Arto Salomaa; Derick Wood 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 768 KB

Vertex-reinforced jump processes on tree

Vertex-reinforced jump processes on trees and finite graphs

✍ Burgess Davis; Stanislav Volkov 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 234 KB

Loop-Erased Random Walk on Finite Graphs

Loop-Erased Random Walk on Finite Graphs and the Rayleigh Process

✍ Jason Schweinsberg 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 402 KB