找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: L Systems; Grzegorz Rozenberg,Arto Salomaa Book 1974 Springer-Verlag Berlin Heidelberg 1974 L-System.Strings.automata.formal language.gram

[复制链接]
查看: 36010|回复: 57
发表于 2025-3-21 19:35:09 | 显示全部楼层 |阅读模式
书目名称L Systems
编辑Grzegorz Rozenberg,Arto Salomaa
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: L Systems;  Grzegorz Rozenberg,Arto Salomaa Book 1974 Springer-Verlag Berlin Heidelberg 1974 L-System.Strings.automata.formal language.gram
出版日期Book 1974
关键词L-System; Strings; automata; formal language; grammars; parallelism
版次1
doihttps://doi.org/10.1007/3-540-06867-8
isbn_softcover978-3-540-06867-9
isbn_ebook978-3-540-37823-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1974
The information of publication is updating

书目名称L Systems影响因子(影响力)




书目名称L Systems影响因子(影响力)学科排名




书目名称L Systems网络公开度




书目名称L Systems网络公开度学科排名




书目名称L Systems被引频次




书目名称L Systems被引频次学科排名




书目名称L Systems年度引用




书目名称L Systems年度引用学科排名




书目名称L Systems读者反馈




书目名称L Systems读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:55:24 | 显示全部楼层
发表于 2025-3-22 02:58:09 | 显示全部楼层
Growth of strings in context dependent Lindenmayer systems, problems concerning the decidability of growth equivalence, growth type classification etc. of context dependent growth are shown to be undecidable. As a byproduct we obtain that the language equivalence of PDILs is undecidable and that a problem proposed by Varshavsky has a negative solution.
发表于 2025-3-22 08:23:52 | 显示全部楼层
Notes on pre-set pushdown automata,l AFL. If all conditions are removed, present pda‘s exactly represent the family of iterated regular substitution languages, a sub-family of the indexed languages. Deterministic preset pda‘s are also studied, and the language-family they define is shown to be closed under complementation, generalizing a classical result.
发表于 2025-3-22 09:37:11 | 显示全部楼层
发表于 2025-3-22 14:29:00 | 显示全部楼层
发表于 2025-3-22 18:34:47 | 显示全部楼层
Structured OL-systems,morphisms) of OL-Languages. The properties of unrestricted SOL-systems are then studied. It is for example shown that the languages generated by them properly include the languages generated by extended table OL-Systems.
发表于 2025-3-22 22:01:29 | 显示全部楼层
发表于 2025-3-23 04:03:31 | 显示全部楼层
Theory of L systems: From the point of view of formal language theory,ch year fruitful and popular. This is exemplified by exponential growth of the number of papers produced (per year), and a linear (with a decent coefficient) growth of both the number of results and the number of people joining the area..(2) It may have already occurred to the reader (and it is cert
发表于 2025-3-23 09:06:30 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 23:50
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表