✦ LIBER ✦

The complement of a finite index matrix language is context sensitive

✍ Scribed by Gheorghe Päun

Book ID: 114037491
Publisher: Elsevier Science
Year: 1980
Weight: 404 KB
Volume: 47
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(80)90504-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Corrigendum to “the complement of a fini

Corrigendum to “the complement of a finite index matrix language is context sensitive”

✍ Gheorghe Pąun 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 199 KB

A finite state probabilistic automaton t

A finite state probabilistic automaton that accepts a context sensitive language that is not context free

✍ Kuo An Chen; Ming-Kuei Hu 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 464 KB

On the family of finite index matrix lan

On the family of finite index matrix languages

✍ Gheorghe Páun 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 817 KB

A note on the index of a context-free la

A note on the index of a context-free language

✍ Neil D. Jones 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 48 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-

On the index of a context-free grammar a

On the index of a context-free grammar and language

✍ Arto Salomaa 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 171 KB