找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Descriptional Complexity of Formal Systems; 13 International Wor Markus Holzer,Martin Kutrib,Giovanni Pighizzini Conference proceedings 201

[复制链接]
查看: 17937|回复: 62
发表于 2025-3-21 17:10:13 | 显示全部楼层 |阅读模式
书目名称Descriptional Complexity of Formal Systems
副标题13 International Wor
编辑Markus Holzer,Martin Kutrib,Giovanni Pighizzini
视频video
概述Up-to-date results.Fast-track conference proceedings.State-of-the-art research
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Descriptional Complexity of Formal Systems; 13 International Wor Markus Holzer,Martin Kutrib,Giovanni Pighizzini Conference proceedings 201
描述This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) objects; state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov complexity.
出版日期Conference proceedings 2011
关键词automata theory; complexity theory; decidability theory; formal language theory; formal methods; grammar
版次1
doihttps://doi.org/10.1007/978-3-642-22600-7
isbn_softcover978-3-642-22599-4
isbn_ebook978-3-642-22600-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag GmbH Berlin Heidelberg 2011
The information of publication is updating

书目名称Descriptional Complexity of Formal Systems影响因子(影响力)




书目名称Descriptional Complexity of Formal Systems影响因子(影响力)学科排名




书目名称Descriptional Complexity of Formal Systems网络公开度




书目名称Descriptional Complexity of Formal Systems网络公开度学科排名




书目名称Descriptional Complexity of Formal Systems被引频次




书目名称Descriptional Complexity of Formal Systems被引频次学科排名




书目名称Descriptional Complexity of Formal Systems年度引用




书目名称Descriptional Complexity of Formal Systems年度引用学科排名




书目名称Descriptional Complexity of Formal Systems读者反馈




书目名称Descriptional Complexity of Formal Systems读者反馈学科排名




单选投票, 共有 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 22:31:51 | 显示全部楼层
A Field Extension as a Vector SpaceGiven a formal language . specified in various ways, we consider the problem of determining if . is nonempty. If . is indeed nonempty, we find upper and lower bounds on the length of the shortest string in ..
发表于 2025-3-22 02:59:02 | 显示全部楼层
Finite Fields I: Basic PropertiesWe study the size-cost of boolean operations on .. We prove an . exponential blow-up for union and intersection, as well as polynomial blow-up for complement.
发表于 2025-3-22 08:36:47 | 显示全部楼层
Stephen Williams,Ayanna M. HowardThe . asks for the size of the smallest DFA needed to distinguish between two words of length ≤ . (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.
发表于 2025-3-22 10:45:56 | 显示全部楼层
Decidability and Shortest Strings in Formal LanguagesGiven a formal language . specified in various ways, we consider the problem of determining if . is nonempty. If . is indeed nonempty, we find upper and lower bounds on the length of the shortest string in ..
发表于 2025-3-22 13:44:08 | 显示全部楼层
发表于 2025-3-22 20:47:56 | 显示全部楼层
Remarks on Separating WordsThe . asks for the size of the smallest DFA needed to distinguish between two words of length ≤ . (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.
发表于 2025-3-22 22:26:46 | 显示全部楼层
发表于 2025-3-23 01:43:00 | 显示全部楼层
978-3-642-22599-4Springer-Verlag GmbH Berlin Heidelberg 2011
发表于 2025-3-23 06:30:02 | 显示全部楼层
A Field Extension as a Vector Spaceood, the inverse automaton may need a much larger neighborhood. Our interest is to find good upper bounds for the size of this inverse neighborhood. It turns out that a linear algebra approach provides better bounds than any known combinatorial methods. We also consider cellular automata that are no
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 11:48
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表