EOL and ETOL array languages
01 Jul 1981-Vol. 90, Iss: 3, pp 167-180
TL;DR: Standard forms for ETOL and EOL array systems are defined and closure properties of the families are studied and relations of these families with other developmental array languages and other array languages are studied.
Abstract: In this paper we study the families of ETOL and EOL array languages. Standard forms for ETOL and EOL array systems are defined and closure properties of the families are studied. Relations of these families with other developmental array languages and other array languages are studied.
Citations
More filters
Book•
[...]
TL;DR: Investigations into Drosophila Wing Development - Results from a Lindenmayer Model and the Theoretical Basis of the Transplantation Experiment.
Abstract: Investigations into Drosophila Wing Development - Results from a Lindenmayer Model.- Fibonacci Words - A Survey.- Planar Map Generation by Parallel Binary Fission/Fusion Grammars.- Modular Trellises.- A New Proof for the DOL Sequence Equivalence Problem and its Implications.- On Compound Lindenmayer Systems.- Graph Grammars with Application Conditions.- The ETOL Hierarchy is in the OI Hierarchy.- Polyhedral Cell Shapes.- On Cyclically Overlap-Free Words in Binary Alphabets.- The Theoretical Basis of the Transplantation Experiment.- Fixed and Stationary ?-Words and ?-Languages.- DOL Schemes and Recurrent Words.- Stochastic OL Systems and Formal Power Series.- Complexity of L-Systems.- Compartmental Hybrid State Production-Diffusion Systems with Application to Prestalk-Prespore Pattern Regulation in Cellular Slime Molds.- Hierarchical Aspects of Plant Development.- Rule Trees Represent Derivations in Edge Replacement Systems.- Languages Defined by Indian Parallel Systems.- L Systems and NLOG-Reductions.- The Parikh-Boundedness of ETOL Languages of Finite Index.- Computer Networks with Compact Routing Tables.- Unconventional Leaves.- A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes.- Graph Technology Applied to a Software Project.- Some Systems for Map Generation.- A Programming Language for Lindenmayer Systems.- A Note on Significance of Cellular Interaction in L-System.- EOL Grammars and Search Trees.- Variation in Inflorescence Structure in Cotoneaster Franchetti.- Partial Path Groups and Parallel Graph Contractions.- When L was Young.- Equivalence Problems for Regular Sets of Word Morphisms.- Parentheses Grammars and Lindenmayer Grammars.- Array Languages and Lindenmayer Systems - A Survey.- Symmetric Distributed Termination.- Development, Growth and Time.- On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language.- Graph-Controlled Systems - An Extension of OL Systems.
191 citations
Cites background from "EOL and ETOL array languages"
...It was conjectured in [40] that to test the equivalence of two DOL sequences it is enough to test whether or not the 2n first words of the sequences are the same....
[...]
01 Jan 2012
TL;DR: Volf et al. as mentioned in this paper presented the results, achieved by representatives of the Czech Republic, of the 21st century European Union Science Olympiad (EUSO), which has not even reached ten years.
Abstract: While the Science Olympiads have a long tradition, the new competition of the 21st century European Union Science Olympiad (EUSO) has not even reached ten years. Annually young people aged around 16 years meet in the tasks competition, focusing on integrated science, to show their skills in solving problems in which the knowledge of physics, chemistry and biology is required. Paper presents the results, achieved by representatives of the Czech Republic. Prof. RNDr. Ivo Volf, CSc., RNDr. Jan Křiž, Ph.D., Katedra fyziky, Přirodovědecka fakulta, Univerzita Hradec Kralove, Rokitanskeho 62, 500 03 Hradec Kralove 3, e-mail: ivo.volf@uhk.cz, jan.kriz@uhk.cz Uvodem V roce 2011 již tradicně proběhlo několik přirodovědných předmětových soutěži, jež jsou vedeny jako mezinarodni soutěže, kterých se ucastni mladež z vyssich rocniků střednich skol z mnoha zemi skoro ze vsech světadilů. Tak mame podrobne informace o tom, jak probihala 52. Mezinarodni matematicka olympiada, 42. Mezinarodni fyzikalni olympiada, 43. Mezinarodni chemicka olympiada, 22. Mezinarodni biologicka olympiada. Ziskavat dnesni mladež v technicky zaměřenem světě pro studium přirodovědných oborů až v zavěru středoskolskeho studia se vsak zda být dosti pozdě. Proto je třeba zajem děti vzbuzovat podstatně dřive; mnoho expertů hovoři již o vyssich rocnicich zakladni skoly. Zde vsak naražime na dalsi problem – v mnoha statech nemaji na vyssim stupni zakladniho vzdělani oddělenou výuku jednotlivým skolnim vyucovacim předmětům fyzika, chemie ci biologie, ale toto poznani probiha v integrovaně zaměřených předmětech, jako např. Science (např. Velka Britanie), Sciences Physiques (např. Francie). Proto na pocatku tohoto stoleti vznikla myslenka vytvořit novou přirodovědně zaměřenou soutěž, ktera vychazi z myslenky integrovaneho poznani, a zaměřit se na žaky mladsi, než jsou ti, kteři soutěži v „zavedených“ přirodovědných soutěžich.
27 citations
01 Jan 1986
TL;DR: An interesting comment from a referee is a pointer to the extent to which the theory had developed within a span of five years.
Abstract: In 1968 Lindenmayer introduced a mathematical model of developmental systems [28]. This involves parallel rewriting in which each letter in a string is rewritten using production rules and there is no distinction between terminal and nonterminal symbols reflecting the simultaneous growth of each cell during different stages of development. Since then L-systems have been studied extensively, resulting in the number of research papers growing exponentially [19,29,54,56]. An interesting comment from a referee is a pointer to the extent to which the theory had developed within a span of five years. In 1973 we submitted a paper entitled Parallel O-Lindenmayer Languages which we abbreviated as POL [69]. Then pat came the referee’s comment: “P already stands for ’propagating’ and almost all letters of the alphabet have been used up. You may try PaOL”.
15 citations
TL;DR: A new type of development array system called Table Matrix L system is studied to find a development type of system which could generate interesting picture classes.
Abstract: A new type of development array system called Table Matrix L system is studied. In any rectangular array derivation takes place row by row or column by column restricted by tables so as to make the resultant array rectangular. The motivation for this is to find a development type of system which could generate interesting picture classes. The properties of this system with and without coding and hierarchy are studied.
9 citations
TL;DR: It is observed that by introducing just one operator E the authors can make the table matrix L systems generate almost all the pictures which were previously generated by combining the lack of a completeness condition and partial coding on TMLS.
4 citations
References
More filters
Book•
01 Jan 1975
TL;DR: Developmental systems were introduced in order to model morphogenetic (pattern-generating) processes in growing, multicellular, filamentous organisms by considering the states and outputs to be identical and thus omitting the output functions.
Abstract: Developmental systems were introduced (Lindenmayer, 1968, 1971) in order to model morphogenetic (pattern-generating) processes in growing, multicellular, filamentous organisms. These systems were originally conceived as linear arrays of interconnected finite automata, each automaton corresponding to a living cell, with the possibility that new automata can be added to the array (cells divide) or be deleted from the array (cells die). Each cell in the array is supposed to have the same state-transition and output functions. As required by biological considerations these functions must be applied to all cells in the array simultaneously at each time step. Thus one obtains infinite sequences of arrays once the functions and the initial arrays are specified. Simplified constructs are defined (and used in this paper) by considering the states and outputs to be identical and thus omitting the output functions. Such filamentous developmental systems have been called “Lindenmayer models” Herman, 1969, 1970) or “L-systems” (Van Dalen, 1971).
423 citations
"EOL and ETOL array languages" refers background in this paper
...In the theory of formal languages two generation mechanisms among others have been investigated in the past: Chomsky grammars and Lindenmayer-systems, particularly the latter field, has become a research area of enormous interest in the last few years [ 3 , 5, 6]....
[...]
...In string languages the family of EOL languages and the family of ETOL languages form an abstract family of languages [ 3 ]....
[...]
...It is interesting to note that unlike the string languages [ 3 ], the ETOL array lartguages are not closed under row catenation, row +, column catenation, column +, like the other array languages [9, 10, 11]....
[...]
TL;DR: A linguistic model to generate matrices (arrays of terminals) is presented and immediate application is shown in picture processing by generating a wide class of interesting pictures.
167 citations
TL;DR: Generative models of picture languages with array rewriting rules are presented and each letter of the alphabet of different sizes can be generated by a context-free array grammar.
Abstract: Generative models of picture languages with array rewriting rules are presented. The rewriting rules are regular, context-free or context-sensitive with arrays of terminals in the place of strings of terminals. Derivations are restricted by the condition for row and column catenation. The grammars describe a wide variety of pictures and are more powerful than the matrix grammars for digital pictures introduced in our earlier paper. A distinct hierarchy is shown to exist between the different classes introduced. The models are closed under reflection (about base and rightmost vertical), halfturn, quarter-turn, transpose, and conjugation. Further closure properties such as union, product, star and homomorphism are examined. The models can be applied to generate several interesting patterns of kolam and to describe the repetitive patterns of two-dimensional crystallography. Each letter of the alphabet of different sizes can be generated by a context-free array grammar.
139 citations