✦ LIBER ✦

The formalization of some context conditions of programming languages

✍ Scribed by I.L. Bratchikov; Kh.I. Toirikh

Publisher: Elsevier Science
Year: 1974
Weight: 936 KB
Volume: 14
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(74)90082-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the index of positive programmed form

On the index of positive programmed formal languages

✍ Guozhu Dong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 435 KB

The effective entropies of some extensio

The effective entropies of some extensions of context-free languages

✍ Dung T. Huynh 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 686 KB

The position of MODULA-2 among programmi

The position of MODULA-2 among programming languages

✍ John Souter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 392 KB

On the parallel recognition of unambiguo

On the parallel recognition of unambiguous context-free languages

✍ Michal Chytil; Maxime Crochemore; Burkhard Monien; Wojciech Rytter 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 716 KB

The structure of constructions in formal

The structure of constructions in formal languages

✍ V.A. Vasil'ev 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 628 KB

The Set of Minimal Words of a Context-fr

The Set of Minimal Words of a Context-free Language is Context-free

✍ Jean Berstel; L. Boasson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let A be a finite, totally ordered alphabet, and let P be the lexicographic ordering on A\*. Let X be a subset of A\*. The language of minimal words of X is the subset of X composed of the lexicographically minimal word of X for each length: The aim of this paper is to prove that if L is a context-