𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Flow languages equal recursively enumerable languages

✍ Scribed by Toshiro Araki; Nobuki Tokura

Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
414 KB
Volume
15
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Recursively enumerable languages and van
Recursively enumerable languages and van Wijngaarden grammars
✍ Jan Van Leeuwen πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science βš– 580 KB

We show that each re language can be generated by a minimal deterministic linear contextfree based strict normal VW-grammar. We also prove that each re language can be generated by a strict normal VW-grammar with at most one metanotion denoting a non-regular contextfree language.

Homomorphic characterizations of recursi
Homomorphic characterizations of recursively enumerable languages with very small language classes
✍ Satoshi Okawa; Sadaki Hirose πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 137 KB

In this paper, we attempt to characterize the class of recursively enumerable languages with much smaller language classes than that of linear languages. Language classes, (i; j) LL and (i; j)ML, of (i; j) linear languages and (i; j) minimal linear languages are deΓΏned by posing restrictions on the

PC grammar systems with five context-fre
PC grammar systems with five context-free components generate all recursively enumerable languages
✍ ErzsΓ©bet Csuhaj-VarjΓΊ; Gheorghe PΔƒun; GyΓΆrgy Vaszil πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 143 KB

Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven component