✦ LIBER ✦

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

✍ Scribed by Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd; Michael R. Laurence

Book ID: 108281250
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 379 KB
Volume: 373
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.10.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equivalence of conservative, free, linea

Equivalence of conservative, free, linear program schemas is decidable

✍ Michael R. Laurence; Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A program schema deÿnes a class of programs, all of which have identical statement structures, but whose expressions may di er. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent.

Tree equivalence of linear recursive sch

Tree equivalence of linear recursive schemata is polynomial-time decidable

✍ V.K. Sabelfeld 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 856 KB

Decidability of strong equivalence for s

Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas

✍ Sebastian Danicic; Robert M. Hierons; Michael R. Laurence 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 573 KB

Equivalence of free boolean graphs can b

Equivalence of free boolean graphs can be decided probabilistically in polynomial time

✍ Manuel Blum; Ashok K. Chandra; Mark N. Wegman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Deciding context equivalence of binary o

Deciding context equivalence of binary overlap-free words in linear time

✍ Shur, Arseny M. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 795 KB