✦ LIBER ✦

On the reachability of a version of graph-rewriting system

✍ Scribed by Kohji Tomita; Haruhisa Kurokawa

Book ID: 108154636
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 207 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.03.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deriving a Graph Rewriting System from a

Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding

✍ Rom Langerak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 989 KB

The starting point of this paper is McMillan's complete nite pre x of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly in nite) system behaviour from the complete nite pre x. An algorithm is presente

On the vector representation of the reac

On the vector representation of the reachability in planar directed graphs

✍ T. Kameda 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Rewrite systems on a lattice of types

✍ R. J. Cunningham; A. J. J. Dick 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 921 KB

On the time-space complexity of reachabi

On the time-space complexity of reachability queries for preprocessed graphs

✍ Lisa Hellerstein; Philip Klein; Robert Wilber 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 587 KB

On the efficiency of categorical combina

On the efficiency of categorical combinators as a rewriting system

✍ R. D. Lins 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 604 KB

A result on braids via the investigation

A result on braids via the investigation of a rewriting system

✍ Serge Burckel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 87 KB

The study of a rewriting system gives a very simple characterization of a canonical form of positive braids on three strands which had previously been defined with a well-ordering structure.