Results 101 to 110 of about 510 (156)
Some of the next articles are maybe not open access.
ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
International Journal of Foundations of Computer Science, 2007A generalization of centralized and returning parallel communicating grammar systems with linear components (linear CPC grammar systems) is studied. It is known that linear CPC grammar systems are more powerful than regular CPC grammar systems and that CPC grammar systems with context-free components are more powerful than linear CPC grammar systems ...
Bettina Sunckel, Andreas Malcher
openaire +2 more sources
On parallel evaluation of ordered attribute grammars
Journal of Computer Science and Technology, 1991In this paper, a parallel algorithm is presented for the evaluation of ordered attribute grammars. The parallelism is achieved by constructing the so-called parallel visit sequences and accordingly augmenting the ordinary evaluation driver as well.
Daxing Ye, Shunqian Wang
openaire +2 more sources
Parallel stochastic grammar induction
Proceedings of International Conference on Neural Networks (ICNN'97), 2002This paper examines the problem of stochastic grammar induction and gives a formal analysis of observed limitations of a classical algorithm. It then describes a parallel approach to the problem which avoids these limitations. Finally, a proof is presented which shows that a popular training algorithm already in use for recurrent connectionist networks
openaire +2 more sources
SOME NOTES ON PARALLEL COORDINATE GRAMMARS
International Journal of Pattern Recognition and Artificial Intelligence, 1995In a coordinate grammar, the rewriting rules replace sets of symbols having given coordinates by sets of symbols whose coordinates are given functions of the coordinates of the original symbols. Usually, at each step of a derivation, only one rule is applied and only one instance of its left hand side is rewritten.
openaire +2 more sources
Probabilistic Parallel Communicating Grammar Systems
International Journal of Computer Mathematics, 2002Grammar systems are theoretical models of distributed computing which play a major role in modern Computer Science. In this paper, we define and study a variant of Parallel Communicating(PC) grammar systems namely, Probabilistic PC grammar systems which serves as a grammatical model for random distributed processing.
Kamala Krithivasan, K. Arthi
openaire +2 more sources
Parallel communicating grammar systems as language analyzers
Grammars, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bordihn, Henning +2 more
openaire +3 more sources
The Feature Space in Parallel Grammar Writing
Research on Language and Computation, 2005This paper discusses the methodology and tools applied in the Parallel Grammar project (ParGram) to support consistency and parallelism of linguistic representations across multilingual Lexical Functional Grammar (lfg) grammars. A particular issue is that the grammars in the ParGram project are developed at different international sites.
Martin Forst +3 more
openaire +2 more sources
On sequential and parallel node-rewriting graph grammars
Computer Graphics and Image Processing, 1982Summary: The aim of this paper is to discuss and compare two embedding mechanisms used in graph grammars: a connection relation mechanism (introduced by \textit{D. Janssens} and \textit{G. Rosenberg} [Inf. Sci. 20, 217-244 (1980; Zbl 0452.68074)]) and a stencil mechanism (introduced by \textit{K. Culik II} and \textit{A. Lindenmayer} [Proc.
Dirk Janssens +2 more
openaire +2 more sources
Descriptional complexity of multi-parallel grammars
Information Processing Letters, 2008This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors. As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.
openaire +2 more sources
Parallel Grammars: A Short Phenomenology
2004It is simply impossible to cover all aspects of parallel grammars in the short space and time given to the subject here. We like to avoid repeating the material on classical L systems excellently presented in [3], [2, Vol. 1, Chapter 5] or [2, Vol. 3, Chapter 9].
openaire +2 more sources