✦ LIBER ✦

On the decidability of homomorphism equivalence for languages

✍ Scribed by K. Culik II; Arto Salomaa

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 779 KB
Volume: 17
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90002-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The decidability of equivalence for dete

The decidability of equivalence for deterministic finite transducers

✍ Meera Blattner; Tom Head 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 294 KB

The decidability of the DOL-DTOL equival

The decidability of the DOL-DTOL equivalence problem

✍ Keijo Ruohonen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 660 KB

The Equivalence Problem for DF0L Languag

The Equivalence Problem for DF0L Languages and Power Series

✍ Juha Honkala 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We show that equivalence is decidable for D0L systems with finite axiom sets. We discuss also DF0L power series and solve their equivalence problem over computable fields.

Some Elementary Results About the Equiva

Some Elementary Results About the Equivalence of Computability and Decidability

✍ Ulrich Huckenbeck 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

A simple proof on the decidability of eq

A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs

✍ H. Leung; D. Ranjan; H.J. Hernández; D. Tang; A. González 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 308 KB

A Technique for Proving Decidability of

A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries

✍ Oscar H. Ibarra; Jianwen Su 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 286 KB