Results 1 to 10 of about 345 (229)

On the number of components in cooperating distributed grammar systems [PDF]

open access: yesTheoretical Computer Science, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn
exaly   +8 more sources

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes [PDF]

open access: yesElectronic 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 ...
Henning Fernau   +2 more
doaj   +6 more sources

Left-forbidding cooperating distributed grammar systems [PDF]

open access: yesTheoretical Computer Science, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Filip Goldefus   +2 more
exaly   +5 more sources

Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization [PDF]

open access: yesTheoretical 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
exaly   +4 more sources

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes ⩽k and =k [PDF]

open access: yesTheoretical Computer Science, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Fernau   +2 more
exaly   +5 more sources

Cooperating Distributed Grammar Systems with Random Context Grammars as Components [PDF]

open access: yesActa 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   +5 more sources

Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence [PDF]

open access: yes, 2011
We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form -- and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that ...
Maurice H. ter Beek   +3 more
openaire   +1 more source

Cooperating distributed context-free hexagonal array grammar systems with permitting contexts [PDF]

open access: yesInternational 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   +2 more sources

Home - About - Disclaimer - Privacy