Results 1 to 10 of about 402,233 (248)
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes [PDF]
, 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 +9 more sources
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
On Competence in CD Grammar Systems [PDF]
, 2004 We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be =k-competent (=k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different ...
ter Beek M +3 more
openaire +4 more sources
Grammar-based Representation and Identification of Dynamical Systems [PDF]
, 2018 In this paper we propose a novel approach to identify dynamical systems. The method estimates the model structure and the parameters of the model simultaneously, automating the critical decisions involved in identification such as model structure and ...
gorn, khandelwal, koza, madár
core +2 more sources
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems [PDF]
, 2019 We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets).
Leroux, J. +3 more
core +4 more sources
Inferring Chemical Reaction Patterns Using Rule Composition in Graph Grammars [PDF]
, 2012 Modeling molecules as undirected graphs and chemical reactions as graph rewriting operations is a natural and convenient approach tom odeling chemistry. Graph grammar rules are most naturally employed to model elementary reactions like merging, splitting,
Andersen, Jakob L. +3 more
core +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
, 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
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
, 2008 Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures.
Bruno Guillaume +5 more
core +8 more sources