找回密碼
 To register

QQ登錄

只需一步，快速開始

掃一掃，訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
查看: 18015|回復: 62
樓主
發(fā)表于 2025-3-21 17:10:13 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Descriptional Complexity of Formal Systems
副標題13 International Wor
編輯Markus Holzer,Martin Kutrib,Giovanni Pighizzini
視頻videohttp://file.papertrans.cn/269/268293/268293.mp4
概述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網(wǎng)絡公開度




書目名稱Descriptional Complexity of Formal Systems網(wǎng)絡公開度學科排名




書目名稱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
您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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 ..
板凳
發(fā)表于 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.
地板
發(fā)表于 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.
5#
發(fā)表于 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 ..
6#
發(fā)表于 2025-3-22 13:44:08 | 只看該作者
7#
發(fā)表于 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.
8#
發(fā)表于 2025-3-22 22:26:46 | 只看該作者
9#
發(fā)表于 2025-3-23 01:43:00 | 只看該作者
978-3-642-22599-4Springer-Verlag GmbH Berlin Heidelberg 2011
10#
發(fā)表于 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
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 12:58
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
定边县| 宜君县| 赣州市| 南雄市| 思茅市| 库伦旗| 亚东县| 东丰县| 公安县| 金堂县| 巩义市| 临桂县| 信丰县| 新巴尔虎左旗| 中西区| 望都县| 北票市| 栾城县| 灵台县| 西峡县| 霍邱县| 五原县| 菏泽市| 英超| 泸州市| 温宿县| 河曲县| 云浮市| 玛纳斯县| 铁力市| 琼海市| 和硕县| 桦甸市| 包头市| 兴化市| 上栗县| 弋阳县| 修武县| 襄城县| 汶上县| 陵水|