1 / 14

Lindenmayer Systems

Lindenmayer Systems. There is no distinction between terminal and non-terminal symbols. All the words derived from a given word are in the language. All letters of a word are rewritten simultaneously. Motivation - the description of the development of filamentous organisms

neorah
Télécharger la présentation

Lindenmayer Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lindenmayer Systems

  2. There is no distinction between terminal and non-terminal • symbols. All the words derived from a given word are in the • language. All letters of a word are rewritten simultaneously. • Motivation • - the description of the development of filamentous organisms • - words represent stages of development of disposition of cells • - productions correspond to the instructions for generating • organisms and are applied simultaneously to letters as • developmenof cells is simultaneous in organisms • there are no terminals because they would correspond to dead • cells; disappearance of a cell is represented by the empty word l. • The various parts of a developing organism might communicate among themselves. The basic system model assumes that there is no communication. Lindenmayer systems

  3. An OL system is OLS = (V, P0, F), where V is an alphabet, P0 is a non-empty word on V (axiom or initial word), F is a set of ordered pairs (a,P) with a  V, P  (V+{l} such that for every a  V there is at least a word P in (a, P)  F (we write a  P and call it a production). The relation Þ OLS is defined as follows: P Þ Q holds if and only if P = a1 … an, Q = Q1… Qn and ai Qi , n  i  1 The generated language is defined as L (OLS) = {P | P0 Þ *P} An OL system is deterministic (DOL) if and only if for every a  V there is exactly one word P such that (a,P)  F. An OL system is l -free or propagating (POL) if and only if for every production a  P in F, P is not l. Two systems are equivalent if they generate the same language. OL systems(1)

  4. OL systems (2) • Examples. • OLS = ({a}, a, {a  a2 }) L(OLS) = {a2n | n  0} 2) OLS = ({a, b}, a, {a  b , b  ab}) L(OLS) = {a, b, ab, bab, abbab, bababbab, …} (word lenghts are the Fibonacci’s numbers) • OLS = ({a, b, c}, a, {a  abcc , b  bcc, c  c}) L(OLS) = {a, abcc, abccbcccc, abccbccccbcccccc, …} (word lenghts are the squares of natural numbers) Note. All the systems are DOL systems and the languages are context dependent.

  5. OL systems (3) Example (red alga). Consider the propagating DOL system with alphabet and productions as in the table 1 2 3 4 5 6 7 ( ) # 0 2 # 3 2 2 # 4 504 6 7 8(1) ( ) # 0 The words derived from the axiom P0 = 1 are P0= 1 P1= 2 # 3 P2= 2 # 2 # 4 P3= 2 # 2 # 504 P4= 2 # 2 # 60504 P5= 2 # 2 # 7060504 P6= 2 # 2 # 8(1)07060504 Pn+6 = 2 # 2 # 8(Pn)08(Pn-1) 0 … 08 P0 07060504

  6. Representation Parenthesized expressions are branches whose position is indicated by the 8’s. The 0’s are represented as oblique walls alternatively bending to the left and to the right. Branches are attached alternatively on one and on the other side of the branch where they are born. The symbols # are represented as vertical walls. OL systems (4) 1 2 8 7 6 5 4 2 4 1 2 2 8 2 2 8 6 5 8 7 4 2 3

  7. Properties of OL languages (1) We call anti-AFL a family of languages which is not closed under union, l-free concatenation, l-free omomorphism, inverse omomorphism, and intersection with regular languages. Theorem. The family of OL languages is anti-AFL. Teorema. The family of OL languages is closed under specular image. Proof. If a language is generated by the system (V, P0, F), its specular image is generated by the system (V, mi(P0), mi(F)) where mi(F) is obtained from F by replacing right parts of productions with their specular images.

  8. Properties of OL languages (2) Theorem. Every OL language is context dependent. Proof. Let L be generated by the OL system H = (V, P0, F). Let us take the grammar G = ({X0, X1, X2, X3}, V, X0, F1) where F1 consists of the productions X0  X1 P0 X1 X1l X1a  X1 X2 a for every a  V X2 X1  X3 X1 a X3 X3 a for every a  V X1 X3  X1 X2a  P X2 for every production a  Pin F. It can be proved that L(G) = L(H).

  9. Properties of OL languages (3) Example. Let us take the system OLS = ({a,b}, a, {a  b, b  ab}. The context dependent grammar generating the same language is G = ({X0, X1, X2, X3}, {a,b}, X0, F1) where F1 consists of the productions X0  X1 a X1 X1l X1a  X1 X2 a X1b  X1 X2 b X2a  b X2 X2b  ab X2 X2 X1  X3 X1 a X3 X3 a b X3 X3 b X1 X3  X1

  10. A TOL system is H = (V, P0, T) where V and P0 are as in the OL systems and T is a collection of subsets of V  (V+{l}. Every t  T satisfies the condition: for every a  V there is P  (V+{l}) such that t contains the pair (a, P). P Þ Q if and only if there esists k  1, letters a1 , … , ak, words Q1 , … , Qk and t contains the pair (ai, Qi) per k  i  1. The generated language is L (H) = {P | P0 Þ *P} Motivation. At every step only productions are used which belong to the same table. The biological motivation is that at different stages of development of an organism sets of different rules may be needed. TOL systems (1)

  11. TOL systems (2) Example. Let us take the system H = ({a}, a, {{a  a2}, {a  a3}}). We have L(H) = {ai | i = 2m3n, m,n  0. L(H) is not an OL language. Theorem. OL languages are properly contained in TOL languages.

  12. A 2L system is H = (V, P0, a0, F), where: • V and P0 are as in OL systems • a0  Vis the input from the environment • F is a subset of V  V  V  (V+ {l} such that for all the (non necessarily distinct) letters a, b, c  Vthere is a word • P V+ {l} such that F contains the quadruple (a,b,c,P). • P Þ Q if and only if there exists n  1, letters a1 , … , an, words • Q1 , … , Qn such that F contains the quadruples • (a0, a1, a2, Q1), …, (ai-1, ai, ai+1, Qi), …, (an-1, an, a0, Qn) per n-1 i  2 • P =a1…an andQ =Q1…Qn. • For n= 1 F contains the quadruple (a0, a1, a0, Q1). • The language generated by H is L(H) = {P | P0Þ*P}. 1L e 2L systems (1)

  13. 1L and 2L systems (2) • A 2Lsystem is a 1L system if and only if one of the following • conditions holds: • for every a, b, c, P F contains the quadruple (a,b,c,P) if and only if it contains the quadruple (a,b,d,P) • or • for every a, b, c, P F contains the quadruple (a,b,c,P) if and only if it contains the quadruple (d,b,c,P). • Theorem. There is a 1L language which is non an Ol language and • there is a 22L language which is non a 1L language.

  14. References Lindenmayer A., Mathematical Models for Cellular Interaction in Development, Journal of Theoretical Biology 18(1968), 280-289. Rozenberg G., Salomaa A., The Mathematical Theory of L Systems, Academic Press, New York, 1980. Prusinkiewicz P., Lindenmayer A.,The Algorithmic Beauty of Plants. Springer Verlag, New York, 1990.

More Related