✦ LIBER ✦

Rewrite systems on a lattice of types

✍ Scribed by R. J. Cunningham; A. J. J. Dick

Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 921 KB
Volume: 22
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264228

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On termination of one rule rewrite syste

On termination of one rule rewrite systems

✍ Pierre Lescanne 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Methodical specification of abstract dat

Methodical specification of abstract data types via rewriting systems

✍ P. A. S. Veloso 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 785 KB

On decidability of LTL model checking fo

On decidability of LTL model checking for process rewrite systems

✍ Laura Bozzelli; Mojmír Křetínský; Vojtěch Řehák; Jan Strejček 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

On three variants of rewriting P systems

✍ Claudio Ferretti; Giancarlo Mauri; Gheorghe Păun; Claudio Zandron 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

We continue here the study of P systems with string objects processed by rewriting rules, by investigating some questions which are classic in formal language theory: leftmost derivation, conditional use of rules (permitting and forbidding conditions), relationships with language families in Chomsky

Evolution systems on a lattice

✍ V. V. Zharinov 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 483 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.