Results 141 to 150 of about 27,468 (206)
Some of the next articles are maybe not open access.
10th Annual Symposium on Switching and Automata Theory (swat 1969), 1969
A new type of grammar, called a parallel leveled grammar, is introduced. The families of languages generated by such grammars with contextfree, linear or right-linear subrules are studied. Right-linear parallel finite-leveled languages can be displayed as nested vector expressions, which are extensions of regular expressions. Various hierarchy theorems
B. O. Nash, Rina S. Cohen
openaire +1 more source
A new type of grammar, called a parallel leveled grammar, is introduced. The families of languages generated by such grammars with contextfree, linear or right-linear subrules are studied. Right-linear parallel finite-leveled languages can be displayed as nested vector expressions, which are extensions of regular expressions. Various hierarchy theorems
B. O. Nash, Rina S. Cohen
openaire +1 more source
Parallel Grammars: A Phenomenology
Grammars, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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 ...
Malcher, Andreas, Sunckel, Bettina
openaire +1 more source
Parallel Composition of Graph Grammars
Applied Categorical Structures, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Parallel evaluation of attribute grammars
IEEE Transactions on Parallel and Distributed Systems, 1992Examines the generation of parallel evaluators for attribute grammars, targeted to shared-memory MIMD computers. Evaluation-time overhead due to process scheduling and synchronization is reduced by detecting coarse-grain parallelism (as opposed to the naive one-process-per-node approach).
A. Klaiber, M. Gokhale
openaire +1 more source
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.
K. Arthi, Kamala Krithivasan
openaire +1 more source
Parallel ordered attribute grammars
Proceedings of the 1992 International Conference on Computer Languages, 2003Ordered attributed grammars (OAGs) are extended for use on parallel computers. A partition of the attributes of a tree leads to parallel evaluation if each partition is taken care of by a separate process. Visit sequences for parallel ordered attribute grammars (POAGs) are constructed, and it is shown that the POAG class is of the same power as the OAG
openaire +1 more source
Parallel Grammars and Computation
2017Originally, computer programs were always executed strictly sequentially. Indeed, to perform a computational task, an algorithm was written and implemented as an instruction sequence executed on a central processing unit on a single computer. Only one instruction was executed at a time, so after this instruction was completed, the next instruction was ...
Alexander Meduna, Ondřej Soukup
openaire +1 more source
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 +1 more source
On Descriptional Complexity of Partially Parallel Grammars
Fundamenta Informaticae, 2008This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no ...
Masopust, Tomáš, Meduna, Alexander
openaire +2 more sources