✦ LIBER ✦

Sequential extension of algorithmic languages

✍ Scribed by A. A. Letichevskii

Publisher: Springer US
Year: 1971
Tongue: English
Weight: 475 KB
Volume: 3
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01073796

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Features of the implementation of algori

Features of the implementation of algorithmic languages in minicomputers

✍ N. S. Abramenko; T. F. Slobodyanyuk 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 349 KB

Coincidental extension of scattered cont

Coincidental extension of scattered context languages

✍ A. Meduna 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 122 KB

Coincidental extension of scattered cont

Coincidental extension of scattered context languages

✍ Alexander Meduna 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 55 KB

Extension sistema of the program languag

Extension sistema of the program language PROEKT

✍ Yu. V. Kapitonova; A. A. Letichevskii; V. V. Fedyurko; G. K. Sherstoboeva 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 804 KB

Constructing a family of algorithmic lan

Constructing a family of algorithmic languages for programming and design of multiprocessor computer systems

✍ V. M. Glushkov; Yu. V. Kapitonova; A. A. Letichevskii 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 984 KB

On the extension of Gladkij's Theorem an

On the extension of Gladkij's Theorem and the Hierarchies of languages

✍ Yoshihide Igarashi; Namio Honda 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 939 KB

Let T be a computable, monotonic increasing function from non-negative integers to positive integers. Then it is said that c~ \_C Z\* is in a class Lr if there exists a phrase structure grammar G, which generates all words of length n in c~ within length T(n) of derivations for each n. A main result