Results 211 to 220 of about 700 (231)
Some of the next articles are maybe not open access.
Teams in grammar systems: hybridity and weak rewriting
Acta Cybern., 1996Summary: Some new ideas in the theory of teams in grammar systems are introduced and studied. Traditionally, a team is formed from a finite number of sets of productions, and in every derivation step one production from each component is used to rewrite a symbol of the sentential form. Hence rewriting is done in parallel.
openaire +5 more sources
Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems
2010Multiple Context-Free Grammars (MCFGs) have been introduced by Seki et al. (1991) while the equivalent Linear Context-Free Rewriting Systems (LCFRSs) were independently proposed by Vijay-Shanker, Weir, and Joshi (1987). The central idea is to extend CFGs such that non-terminal symbols can span a tuple of strings that need not be adjacent in the input ...
openaire +1 more source
Array P Systems and Pure 2D Context-Free Grammars With Independent Mode of Rewriting
Journal of Membrane Computing, 2022Rodica Ceterchi +2 more
exaly
Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars
Lecture Notes in Computer Science, 1991Grzegorz Rozenberg, Joost Engelfriet
exaly
Evolutionary Development of Growing Generic Sorting Networks by Means of Rewriting Systems
IEEE Transactions on Evolutionary Computation, 2020Michal Bidlo
exaly
Context-Free Handle-Rewriting Hypergraph Grammars
Lecture Notes in Computer Science, 1991Bruno Courcelle +2 more
exaly
An Example of Design Optimization for High Evolvability: String Rewriting Grammar
BioSystems, 2003Hideaki Suzuki
exaly

