𝔖 Bobbio Scriptorium
✦   LIBER   ✦

More on the power of chain rules in context-free grammars

✍ Scribed by Norbert Blum

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
643 KB
Volume
27
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the computational power of context-fr
On the computational power of context-free PC grammar systems
✍ Niculae Mandache πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 132 KB

It is shown that non-returning parallel communicating grammar systems with -free contextfree components can generate any recursively enumerable language. Since it was proven that such systems can be simulated by returning PC grammar systems with context-free components, the result extends to those.

On the computational completeness of con
On the computational completeness of context-free parallel communicating grammar systems
✍ ErzsΓ©bet Csuhaj-VarjΓΊ; GyΓΆrgy Vaszil πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 632 KB

We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete.

The diagnostic role of signals in the co
The diagnostic role of signals in the context of perceived risks in online shopping: Do signals matter more on the Web?
✍ Dipayan Biswas; Abhijit Biswas πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 167 KB

Four experimental studies examine the differential effects of three signalsβ€”retailer reputation, perceived advertising expenses, and warrantiesβ€”on consumer risk perceptions, across two (online and in-store) shopping conditions. The results of three studies suggest that for products with high non-dig