Pages that link to "Item:Q4072878"

The following pages link to Description of developmental languages using recurrence systems (Q4072878):

Displaying 50 items.

• L-system specification of knot-insertion rules for non-uniform B-spline subdivision (Q419478) (← links)
• The goodness of \(\{S,a\}\)-EOL forms is decidable (Q584929) (← links)
• On commutative DTOL systems (Q599514) (← links)
• Quasi-deterministic 0L systems and their representation (Q672456) (← links)
• Dynamical properties of PWD0L systems (Q673067) (← links)
• Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
• On the union of 0L languages (Q685483) (← links)
• Priorities on context conditions in rewriting systems (Q754654) (← links)
• Rewriting systems with a clocking mechanism (Q754655) (← links)
• Speed-varying OL systems (Q754656) (← links)
• Stability of desynchronized 0L-systems (Q794173) (← links)
• Homomorphic images of sentential form languages defined by semi-Thue systems (Q795513) (← links)
• Stability in L systems (Q802316) (← links)
• A periodic division pattern that cannot be generated by D0L systems (Q804298) (← links)
• Iterated sequential transducers as language generating devices (Q861252) (← links)
• A model for developmental systems. I: Generating word without any operating system (Q913692) (← links)
• On a relationship between graph L-systems and picture languages (Q1051434) (← links)
• Fair derivations in E0L systems (Q1062767) (← links)
• A morphic representation of EOL languages and other ETOL languages (Q1067416) (← links)
• A note on an extension of matrix grammars generating two-dimensional languages (Q1067791) (← links)
• Context dependent table matrix L systems (Q1083866) (← links)
• Concerning two-adjacent context-free languages (Q1085985) (← links)
• Interactive L systems with a fast local growth (Q1115192) (← links)
• Regeneration in 1L systems (Q1115193) (← links)
• On the degree of synchronization of k1TOL and k1ETOL systems (Q1124362) (← links)
• On recursion in ETOL systems (Q1137387) (← links)
• On ETOL systems with rank (Q1138388) (← links)
• Codeterministic Lindenmayer schemes and systems (Q1139944) (← links)
• An approach to a unified theory of grammar and L forms (Q1140995) (← links)
• Persistent ETOL systems (Q1143810) (← links)
• Programmed OL-systems (Q1148691) (← links)
• A-transducers and the monotonicity of IL schemes (Q1148692) (← links)
• On DIL schemes simulated by DOL schemes (Q1149788) (← links)
• An automaton generating series of graphs (Q1160576) (← links)
• Grammars with valuations - a discrete model for self-organization of biopolymers (Q1164435) (← links)
• The decidability of the DOL-DTOL equivalence problem (Q1167540) (← links)
• (g//0,g//1,\dots ,g//k)-trees and unary OL systems (Q1169816) (← links)
• The copying power of one-state tree transducers (Q1169826) (← links)
• On the generative capacity of compound string and array grammars (Q1171392) (← links)
• DOL schemes and the periodicity of string embeddings (Q1173408) (← links)
• Machine characterization of (E0L-E0L) array languages (Q1177144) (← links)
• Computer simulation of bidimensional growth of the gametophyte of \(Anemia\) \(phyllitidis\) (L.) Sw (Q1183731) (← links)
• Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
• The membership question for ETOL-languages is polynomially complete (Q1219165) (← links)
• Three results of comparison between L languages with and without interaction (Q1219691) (← links)
• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems (Q1220388) (← links)
• Ambiguity in the developmental systems of Lindenmayer (Q1221634) (← links)
• Subword complexities of various classes of deterministic developmental languages without interactions (Q1221635) (← links)
• Time-delayed OL languages and sequences (Q1222023) (← links)
• Copying theorems (Q1224420) (← links)