✦ LIBER ✦

The equivalence of pre-NTS grammars is decidable

✍ Scribed by J. -M. Autebert; L. Boasson

Publisher: Springer
Year: 1992
Tongue: English
Weight: 743 KB
Volume: 25
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01368784

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The pre-NTS property is undecidable for

The pre-NTS property is undecidable for context-free grammars

✍ Louxin Zhang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 280 KB

The bounded degree problem for NLC gramm

The bounded degree problem for NLC grammars is decidable

✍ Dirk Janssens; Grzegorz Rozenberg; Emo Welzl 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 540 KB

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.

The equivalence of deterministic gsm rep

The equivalence of deterministic gsm replications onQ-rational languages is decidable

✍ Paavo Turakainen 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 642 KB

The equivalence of finite valued transdu

The equivalence of finite valued transducers (on HDT0L languages) is decidable

✍ Karel Culik II; Juhani Karhumäki 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 977 KB

The strong equivalence of ET0L grammars

✍ Gabriel Istrate 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 444 KB

We define a version of structural equivalence of ETOL grammars, called strong equivalence, that takes into account their matrix structure, and prove its decidability. @ 1997 Elsevier Science B.V.