Generating Picture Arrays Based on Grammar Systems with Flat Splicing Operation

2015 ◽  
pp. 251-261
Author(s):  
K. G. Subramanian ◽  
G. Samdanielthompson ◽  
N. Gnanamalar David ◽  
Atulya K. Nagar
Keyword(s):  
Grammar Systems

Some Power-Decreasing Derivation Restrictions in Grammar Systems

2010 ◽  
Vol 19 (-1) ◽  
pp. 23-34
Author(s):  
Alexander Meduna ◽  
Martin Čermák ◽  
Tomáš Masopust
Keyword(s):  
Grammar Systems

Further remarks on parallel communicating grammar systems

1990 ◽  
Vol 34 (3-4) ◽  
pp. 187-203 ◽  
Author(s):  
Gheorghe P[acaron]un ◽  
Lila Sântean
Keyword(s):  
Grammar Systems ◽  
Parallel Communicating Grammar Systems

scholarly journals Parallel communicating grammar systems with context-free components are Turing complete for any communication model

2016 ◽  
Vol 8 (2) ◽  
pp. 113-170
Author(s):  
Mary Sarah Ruth Wilkin ◽  
Stefan D. Bruda
Keyword(s):  
Concurrent Systems ◽  
Communication Model ◽  
Broadcast Communication ◽  
Turing Completeness ◽  
One Step ◽  
Grammar Systems ◽  
Turing Complete ◽  
Context Free ◽  
Original Construction ◽  
Parallel Communicating Grammar Systems

Abstract Parallel Communicating Grammar Systems (PCGS) were introduced as a language-theoretic treatment of concurrent systems. A PCGS extends the concept of a grammar to a structure that consists of several grammars working in parallel, communicating with each other, and so contributing to the generation of strings. PCGS are usually more powerful than a single grammar of the same type; PCGS with context-free components (CF-PCGS) in particular were shown to be Turing complete. However, this result only holds when a specific type of communication (which we call broadcast communication, as opposed to one-step communication) is used. We expand the original construction that showed Turing completeness so that broadcast communication is eliminated at the expense of introducing a significant number of additional, helper component grammars. We thus show that CF-PCGS with one-step communication are also Turing complete. We introduce in the process several techniques that may be usable in other constructions and may be capable of removing broadcast communication in general.

PC Grammar Systems with Non-Chomskyan Components

2018 ◽  
pp. 219-231
Author(s):  
Erzsébet Csuhaj-Varjú ◽  
Jürgen Dassow ◽  
Jozef Kelemen ◽  
Gheorghe Páun
Keyword(s):  
Grammar Systems

Conditional Tabled Eco-Grammar Systems versus (E)TOL Systems

1996 ◽  
pp. 252-268
Author(s):  
Erzsébet Csuhaj-Varjú ◽  
Gheorghe Păun ◽  
Arto Salomaa
Keyword(s):  
Grammar Systems

Cooperating Basic Puzzle Grammar Systems

2006 ◽  
pp. 354-360 ◽  
Author(s):  
K. G. Subramanian ◽  
R. Saravanan ◽  
P. Helen Chandra
Keyword(s):  
Grammar Systems

PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS

2011 ◽  
Vol 22 (01) ◽  
pp. 203-212 ◽  
Author(s):  
ERZSÉBET CSUHAJ-VARJÚ ◽  
MARION OSWALD ◽  
GYÖRGY VASZIL
Keyword(s):  
Future Research ◽  
Open Problems ◽  
Recursively Enumerable Language ◽  
Recursively Enumerable ◽  
Enumerable Language ◽  
Grammar Systems ◽  
Context Free

We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the query is not precisely identified. We prove that if the same component replies to all queries issued to a cluster in a rewriting step, then non-returning PC grammar systems with 3 clusters and 7 context-free components are able to generate any recursively enumerable language. We also provide open problems and directions for future research.

Sign in / Sign up

Export Citation Format

Share Document