Results 181 to 190 of about 298,732 (229)
Some of the next articles are maybe not open access.
On the generative capacity of parallel communicating grammar systems
International Journal of Computer Mathematics, 1992The paper deals with synchronized and non-synchronized parallel communicating grammar systems (PCGS). Our results show, for instance, the high generative power of these mechanisms: one-letter non-regular and other non-semi-linear languages are generated by certain classes of PCGS's, mainly with regular components.
Gheorghe P un +2 more
openaire +2 more sources
A Clock Grammar: The Use of a Parallel Grammar in Performance-Based Mechanical Synthesis
Volume 4: 14th International Conference on Design Theory and Methodology, Integrated Systems Design, and Engineering Design and Culture, 2002Effective methods of computational synthesis for mechanical systems must represent both function and structure in order to generate physical designs with desired behaviors. To this aim, a parallel grammar for mechanical synthesis was developed based on a Function-Behavior-Structure design model.
Kristina Shea, Alex C. Starling
openaire +2 more sources
Multigenerative Grammar Systems and Parallel Computation
2017Today’s environment of cooperating multiprocessor computers allows us to base modern information technologies on a large combination of simultaneously running processes, which make use of this powerful environment as much as possible. Consequently, parallel computation plays a crucially important role in computer science at present as already pointed ...
Alexander Meduna, Ondřej Soukup
openaire +2 more sources
Implementation issues of parallel shape grammars
Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 2018AbstractShape grammars come in a variety of forms. Algebras of shapes have been defined for spatial elements of different kinds, as well as for shapes augmented with varying attributes, allowing for grammar forms to be expressed in terms of a direct product of basic algebras.
openaire +2 more sources
A parallel compilation technique based on grammar partitioning
Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90, 1990A new data partitioning scheme for parallel compilation is presented. The scheme is based on partitioning the grammar, which in turn effectively decomposes the language specification into multiple subsets. The scheme requires definition and development of specialized subcompilers.
Sanjay Khanna +2 more
openaire +2 more sources
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae, 2009In this paper we investigate insertion grammars and explore their capacity to generate words parallelly by introducing parallel derivation (where more than one rule can be applied to the string in parallel) and maximum parallel derivation (where as many rules as possible are applied to the string in parallel).
openaire +2 more sources
Irreducible parallelism in phonology
Natural language & linguistic theory, 2020Jeffrey Adler, Jesse Zymet
semanticscholar +2 more sources
, 2023 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures - SPAA '93, 1993
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntaxdirected analysis and translation. In particular, we address the problem of how to exploit parallelism during the evaluation of the attributes of a derivation tree of a non-circular attribute grammar.
openaire +2 more sources
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntaxdirected analysis and translation. In particular, we address the problem of how to exploit parallelism during the evaluation of the attributes of a derivation tree of a non-circular attribute grammar.
openaire +2 more sources
Graphs of Grammars – Derivations as Parallel Processes
2010In this paper the concepts of the graph of generative grammars and Lindenmayer systems are investigated. These special and-or graphs represent all information about the grammar. For regular grammars the new concept is equivalent to the finite automata. In context-free case it is an extension of the dependency graph. We also analyze how it is related to
openaire +2 more sources