Results 11 to 20 of about 27,032 (186)
Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence [PDF]
Computation, Cooperation, and Life, 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 +2 more sources
On the power of permitting features in cooperating context-free array grammar systems
Discrete Applied Mathematics, 2013 K. Subramanian +2 more
semanticscholar +3 more sources
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
Coordination approaches and systems - part I : a strategic perspective [PDF]
, 2000 This is the first part of a two-part paper presenting a fundamental review and summary of research of design coordination and cooperation technologies. The theme of this review is aimed at the research conducted within the decision management aspect of ...
Coates, Graham +3 more
core +1 more source
Iso-array rewriting P systems with context-free iso-array rules [PDF]
, 2014 A new computing model called P system is a highly distributed and parallel theoretical model, which is proposed in the area of membrane computing. Ceterchi et al.
Bhuvaneswari, K. +4 more
core +1 more source
Owicki-Gries Theory: A Possible Way of Relating Grammar Systems to Concurrent Programs
Triangle, 2018 The aim of this paper is to show how grammar systems and concurrent programs might be viewed as related models for distributed and cooperating computation.
M. Grando
semanticscholar +1 more source
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
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems
, 2009 We consider parallel communicating pushdown automata systems (PCPA) and define a property called known communication for it. We use this property to prove that the power of a variant of PCPA, called returning centralized parallel communicating pushdown ...
Bianca Truthe +14 more
core +2 more sources
, 2017 The L(PSCG)=L(CS) problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this problem in terms of CD grammar systems. More specifically, it characterizes the
Martiško, Jakub, Meduna, Alexander
core +1 more source