Results 1 to 10 of about 26,942 (96)
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize ...
Fernau, Henning +2 more
core +13 more sources
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
Theoretical Computer Science, 2001 We introduce several internally hybrid derivation modes of Cooperating Distributed (CD) grammar systems. External hybridizations were investigated by Mitrana and Păun: for example, some components of a CD grammar system, when enabled, have to work as long as possible -- they work in the so-called \(t\)-mode --, and some others, when enabled, perform at
Henning Fernau +2 more
semanticscholar +4 more sources
Left-forbidding cooperating distributed grammar systems
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Filip Goldefus +2 more
semanticscholar +5 more sources
Generalised Stream X-Machines and Cooperating Distributed Grammar Systems
Formal Aspects of Computing, 2000 Abstract. Stream X-machines are a general and powerful computational model. By coupling the control structure of a stream X-machine with a set of formal grammars a new machine called a generalised stream X-machine with underlying distributed grammars , acting as a translator, is obtained.
M. Gheorghe
semanticscholar +5 more sources
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Fernau +2 more
semanticscholar +5 more sources
On the Degree of Team Cooperation in CD Grammar Systems. [PDF]
Workshop on Descriptional Complexity of Formal Systems, 2011 In this paper, we introduce a dynamical complexity measure, namely the degree of team cooperation, in the aim of investigating "how much" the components of a grammar system cooperate when forming a team in the process of generating terminal words.
A. Atanasiu +10 more
core +2 more sources
Cooperating distributed context-free hexagonal array grammar systems with permitting contexts [PDF]
International Journal of Mathematics Trends and Technology, 2014 16 pages, 6 figures, Published with International Journal of Mathematics Trends and Technology (IJMTT)
K. Sujathakumari, K. S. Dersanambika
openaire +4 more sources
On the number of components in cooperating distributed grammar systems
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn
openaire +5 more sources
Cooperating Distributed Grammar Systems with Random Context Grammars as Components
Acta Cybernetica, 2011 In this paper, we discuss cooperating distributed grammar systems where components are (variants of) random context grammars. We give an overview of known results and open problems, and prove some further results.
Zbynek Krivka, Tomás Masopust
openaire +4 more sources
Uniform Distributed Pushdown Automata Systems. [PDF]
Workshop on Descriptional Complexity of Formal Systems, 2012 We consider here uniform distributed pushdown automata systems (UDPAS), namely distributed pushdown automata systems having all components identical pushdown automata. We consider here just a single protocol for activating/deactivating components, namely
Arroyo Montoro, Fernando +2 more
core +3 more sources