Results 1 to 10 of about 17,989 (134)
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 ...
Henning Fernau +2 more
doaj +13 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
exaly +4 more sources
Left-forbidding cooperating distributed grammar systems
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomáš Masopust, Alexander Meduna
exaly +3 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
exaly +2 more sources
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Fernau +2 more
exaly +3 more sources
Array P Systems and t−Communication [PDF]
, 2009 The two areas of grammar systems and P systems, which have provided interesting computational models in the study of formal string language theory have been in the recent past effectively linked in [4] by incorporating into P systems, a communication ...
Ali, Rosihan M. +3 more
core +2 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 +3 more sources
Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence [PDF]
, 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
Natural Language Dialogue Service for Appointment Scheduling Agents [PDF]
, 1997 Appointment scheduling is a problem faced daily by many individuals and organizations. Cooperating agent systems have been developed to partially automate this task.
Busemann, Stephan +5 more
core +6 more sources
Building a robust dialogue system with limited data [PDF]
, 2000 We describe robustness techniques used in the CommandTalk system at the recognition level, the parsing level, and th dia6ue level, and how these were influenced by the lack of domain data.
Bratt, Elizabeth Owen +3 more
core +3 more sources