✦ LIBER ✦

A method for proving programming languages non context-free

✍ Scribed by Stefan Sokolowski

Book ID: 113162026
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 377 KB
Volume: 7
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(78)90080-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decision method for Parikh slenderness

A decision method for Parikh slenderness of context-free languages

✍ Juha Honkala 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 218 KB

In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by AndraSiu, Dassow, Pgun and Salomaa. Results concerning Pa&h slender languages can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented

A bottom-up parsing method for complete

A bottom-up parsing method for complete context-free tree languages

✍ Kyota Aoki; Kazumi Matsuura 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 580 KB

A recognizing algorithm for a loop free

A recognizing algorithm for a loop free context-sensitive language based on the dynamic programming method

✍ Mitsuru Ikeda; Eiichi Tanaka 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

A pumping lemma for deterministic contex

A pumping lemma for deterministic context-free languages

✍ Sheng Yu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A strong pumping lemma for context-free

A strong pumping lemma for context-free languages

✍ David S. Wise 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Methods for Proving Termination of Rewri

Methods for Proving Termination of Rewriting-based Programming Languages by Transformation

✍ Francisco Durán; Salvador Lucas; José Meseguer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 390 KB