发展系统和语言

A. Lindenmayer, G. Rozenberg
{"title":"发展系统和语言","authors":"A. Lindenmayer, G. Rozenberg","doi":"10.1145/800152.804917","DOIUrl":null,"url":null,"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).","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"440","resultStr":"{\"title\":\"Developmental systems and languages\",\"authors\":\"A. Lindenmayer, G. Rozenberg\",\"doi\":\"10.1145/800152.804917\",\"DOIUrl\":null,\"url\":null,\"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).\",\"PeriodicalId\":229726,\"journal\":{\"name\":\"Proceedings of the fourth annual ACM symposium on Theory of computing\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1972-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"440\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fourth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800152.804917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fourth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800152.804917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 440

摘要

为了模拟生长中的多细胞丝状生物的形态发生(模式生成)过程,引入了发育系统(Lindenmayer, 1968, 1971)。这些系统最初被设想为相互连接的有限自动机的线性阵列,每个自动机对应于一个活细胞,有可能将新的自动机添加到阵列(细胞分裂)或从阵列中删除(细胞死亡)。数组中的每个单元都应该具有相同的状态转换和输出函数。根据生物学考虑的要求,这些功能必须在每个时间步同时应用于阵列中的所有细胞。这样,一旦指定了函数和初始数组,就可以得到无穷序列的数组。通过考虑状态和输出相同,从而省略输出函数,定义了简化结构(并在本文中使用)。这种丝状发展系统被称为“林登迈尔模型”(Herman, 1969, 1970)或“l系统”(Van Dalen, 1971)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Developmental systems and languages
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).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信