Filters








32,506 Hits in 4.6 sec

Parallel Communicating Grammar Systems [chapter]

Lila Santean
1993 Current Trends in Theoretical Computer Science  
Cooperating /distributed grammar systems are an attempt of modelling the process of communication [2] . They consist of a system of grammars working together to produce words of a language.  ...  However, the development of massively parallel processing systems increased the importance of interprocessor communication in the new generation computer design.  ...  One of the grammars is distinguished: the language it generates, by cooperating with the other grammars, is the language of the system.  ... 
doi:10.1142/9789812794499_0047 dblp:series/wsscs/Santean93 fatcat:fqcna5yxg5emzm7sqfityku7pq

Page 1437 of Mathematical Reviews Vol. , Issue 2000b [page]

2000 Mathematical Reviews  
Summary: “We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems; this is done by showing how the parallel com- municating  ...  ) ; Paun, Gheorghe (R-AOS; Bucharest) On the regularity of languages generated by context-free evolutionary grammars.  ... 

Page 3618 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
Summary: “In this note we prove that the equations satisfied by one-letter regular languages are exactly those satisfied by commu- tative regular languages.  ...  We point out that previous normal form results hold in all three cases, and prove that, as for parallel communicating grammars, the generative power of parallel com- municating Lindenmayer systems is equal  ... 

Page 7817 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
Summary: “The generative capacity of parallel communicating grammar systems is considered in the context that the compo- nent grammars have distinct terminal and nonterminal sets.  ...  Artificial Intelligence 15 (1996), no. 2-3, 109-122; MR 97f:68102] as a variant of parallel communicating grammar systems: instead of communication, one considers splicing oper- ations between the sentential  ... 

Learning Subclasses of Parallel Communicating Grammar Systems [chapter]

Sindhu J. Kumaar, P. J. Abisha, D. G. Thomas
2010 Lecture Notes in Computer Science  
 Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest.  ...  Example run for PC (PPL)  From the language generated by the of parallel communicating grammar system Γ = ( N, T, K, (P 0 , S 0 ), (P 1 , A 1 )), let the sample given be abaaaaabaaaa.  ...  In fact L (G) = P ∪ A ∪ P Learning Parallel Communicating Grammar Systems PC (PPL)  We learn the parallel communicating grammar system in which the master component is a regular grammar and the second  ... 
doi:10.1007/978-3-642-15488-1_31 fatcat:cxgmdmep2rcw5hotflf4n7ffd4

Page 4080 of Mathematical Reviews Vol. , Issue 2004e [page]

2004 Mathematical Reviews  
Summary: “We give a new solution for the language equivalence problem for DOL systems with finite axiom sets by using the decidability of the equivalence problem of finite valued transducers on HDTOL languages  ...  One of them is to estimate, for a regular language L, the size of the minimal nondeterministic finite automaton ac- cepting L.  ... 

Splicing Context-Free Matrix Grammars using Parallel Communicating Grammar Systems

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
In this context, we propose, a grammar system, using queries to splice context-free matrix grammars and show that the language generated by this grammar system is incomparable to the language given in  ...  Extensive research on splicing of strings in DNA computing has established important theoretical results in computational theory. Further, splicing on strings has been extended to arrays in[2].  ...  The set of all such spliced context-free matrices Z for the language generated by this parallel communicating grammar system using queries is known as Parallel Communicating on Context-Free Matrix Language  ... 
doi:10.35940/ijitee.l3913.1081219 fatcat:3bu4nstb3ndszntnpj55vovaue

Page 2581 of Mathematical Reviews Vol. , Issue 97D [page]

1997 Mathematical Reviews  
Summary: “The paper considers the simplest class of parallel communicating grammar systems (PCGSs), namely those with regular components, which as yet seems not to be sufficiently investigated.  ...  “We prove that it is possible to simulate each step of a system of one of the types by a fixed number of steps of a system of the other type without losing the parallelism.  ... 

Page 3936 of Mathematical Reviews Vol. , Issue 93g [page]

1993 Mathematical Reviews  
In the present paper the families “(PC,,(Reg)) of languages generated by parallel com- municating grammar systems of degree n with regular individual grammars are investigated.  ...  A parallel communicating grammar system of degree n consists of n individual (Chomsky) grammars each with its own axiom.  ... 

Page 1160 of Mathematical Reviews Vol. , Issue 98B [page]

1998 Mathematical Reviews  
The power of cooperation in rewriting systems is investigated us- ing parallel communicating grammar systems with communciation by command.  ...  Grammar systems with regular components and communication by command are shown to generate exactly all context-sensitive languages, which strengthens a known result.  ... 

Page 3885 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
Splicing grammar systems with regular components may generate non- context-free languages and have more generating power than the standard parallel communicating grammar systems with regular components  ...  Parallel communicating grammar systems consist of component grammars each working on its own sentential forms. In addition there is the possibility of communication between the compo- nents.  ... 

Page 509 of Mathematical Reviews Vol. , Issue 2004a [page]

2004 Mathematical Reviews  
Summary: “We examine the generative power of parallel commu- nicating grammar systems with context-free or EOL components communicating incomplete information, that is, only subwords of their sentential  ...  Erzsébet (H-AOS-C; Budapest) ; Vaszil, Gyérgy (H-AOS-C; Budapest) Parallel communicating grammar systems with incomplete information communication.  ... 

Page 3353 of Mathematical Reviews Vol. , Issue 2001E [page]

2001 Mathematical Reviews  
In a PC grammar system several grammars work on their own sentential forms in parallel and their work is organized in a communicating system to generate a single language.  ...  In this paper we summarize some important results on those classes of parallel communicating grammar systems where the component grammars have bounded resources (with size parameters bounded by constants  ... 

Page 1307 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
The result demonstrates that context-free returning parallel communicating grammar systems are economical tools for language generation.”  ...  Summary: “We show that there exists a natural number / such that every recursively enumerable language can be generated by a context-free returning parallel communicating grammar system where the number  ... 

Page 5137 of Mathematical Reviews Vol. , Issue 97H [page]

1997 Mathematical Reviews  
Summary: “A variant of parallel communicating grammar systems is considered, which can generate in the centralized case the re- cursively enumerable languages by context-free, even right-linear production  ...  Summary: “It is shown that any indexed language is definable by a deterministic linear bounded automaton.” 97h:68065 68Q45 Mihalache, Valeria (R-BUCHM; Bucharest) Parallel communicating grammar systems  ... 
« Previous Showing results 1 — 15 out of 32,506 results