✦ LIBER ✦

Recursive generation of local adjunct languages

✍ Scribed by Johnson M. Hart

Book ID: 105286404
Publisher: Springer
Year: 1975
Tongue: English
Weight: 862 KB
Volume: 9
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01715358

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local Adjunct Languages and Regular Sets

✍ Levy, Leon S. 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 386 KB

An infinite hierarchy of linear local ad

An infinite hierarchy of linear local adjunct languages

✍ Johnson M. Hart 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 678 KB

Ambiguity and decision problems for loca

Ambiguity and decision problems for local adjunct languages

✍ Johnson Murdoch Hart 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Some of the formal properties of the local adjunct languages of Joshi, Kosaraju, and Yamada are developed. This class of languages is a proper subclass of the contextfree languages and is related to the star languages. The first result is that a bounded context-free language is a local adjunct langu

Recursive generation of locally complete

Recursive generation of locally complete tests

✍ S. Yu. Borodai; I. S. Grunskii 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 400 KB

Generation, recognition and parsing of c

Generation, recognition and parsing of context-free languages by means of recursive graphs

✍ F. P. Kaminger 📂 Article 📅 1973 🏛 Springer Vienna 🌐 English ⚖ 550 KB

On the classification of recursive langu

On the classification of recursive languages

✍ John Case; Efim Kinber; Arun Sharma; Frank Stephan 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 289 KB