找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Developments in Language Theory; 10th International C Oscar H. Ibarra,Zhe Dang Conference proceedings 2006 Springer-Verlag Berlin Heidelber

[复制链接]
查看: 47088|回复: 63
发表于 2025-3-21 17:43:55 | 显示全部楼层 |阅读模式
书目名称Developments in Language Theory
副标题10th International C
编辑Oscar H. Ibarra,Zhe Dang
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Developments in Language Theory; 10th International C Oscar H. Ibarra,Zhe Dang Conference proceedings 2006 Springer-Verlag Berlin Heidelber
出版日期Conference proceedings 2006
关键词Automat; Variable; algorithm; algorithms; automata; complexity; complexity theory
版次1
doihttps://doi.org/10.1007/11779148
isbn_softcover978-3-540-35428-4
isbn_ebook978-3-540-35430-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2006
The information of publication is updating

书目名称Developments in Language Theory影响因子(影响力)




书目名称Developments in Language Theory影响因子(影响力)学科排名




书目名称Developments in Language Theory网络公开度




书目名称Developments in Language Theory网络公开度学科排名




书目名称Developments in Language Theory被引频次




书目名称Developments in Language Theory被引频次学科排名




书目名称Developments in Language Theory年度引用




书目名称Developments in Language Theory年度引用学科排名




书目名称Developments in Language Theory读者反馈




书目名称Developments in Language Theory读者反馈学科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:13:25 | 显示全部楼层
发表于 2025-3-22 03:41:10 | 显示全部楼层
Polynomials, Fragments of Temporal Logic and the Variety DA over Tracesbiguous polynomial closure over traces..We also show that there exist natural fragments of local temporal logic that describe this class of languages corresponding to .. All characterizations are known to hold for words.
发表于 2025-3-22 06:49:44 | 显示全部楼层
Equivalence of Functions Represented by Simple Context-Free Grammars with Outputions correspond also to one-state deterministic pushdown transducers. Our algorithm works in time polynomial with respect to |.|+ .(.), where |.| is the size of the textual description of ., and .(.) is the maximum of the shortest lengths of words generated by nonterminals of ..
发表于 2025-3-22 12:40:59 | 显示全部楼层
发表于 2025-3-22 14:35:45 | 显示全部楼层
Prime Decompositions of Regular Languageslanguages and using the characterization we show that every regular language over a unary alphabet has a prime decomposition. We show that there exist co-context-free languages that do not have prime decompositions.
发表于 2025-3-22 19:22:24 | 显示全部楼层
Ciliate Bio-operations on Finite String Multisetsclasses of finite languages which can be obtained by the different strategies, and show that although the string operations we consider are reversible, their parallel application can produce effects resembling the irreversibility of the biological process of gene assembly in ciliates.
发表于 2025-3-22 23:07:46 | 显示全部楼层
Characterizing DNA Bond Shapes Using Trajectoriestypes of bond shapes frequently found in DNA computing..We examine the algebraic properties of sets of trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.
发表于 2025-3-23 05:03:01 | 显示全部楼层
发表于 2025-3-23 08:42:56 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-26 16:07
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表