找回密碼
 To register

QQ登錄

只需一步，快速開(kāi)始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 18003|回復(fù): 62
樓主
發(fā)表于 2025-3-21 17:10:13 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems
副標(biāo)題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
叢書(shū)名稱(chēng)Lecture Notes in Computer Science
圖書(shū)封面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
關(guān)鍵詞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

書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems影響因子(影響力)




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems被引頻次




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems被引頻次學(xué)科排名




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems年度引用




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems年度引用學(xué)科排名




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems讀者反饋




書(shū)目名稱(chēng)Descriptional Complexity of Formal Systems讀者反饋學(xué)科排名




單選投票, 共有 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
您所在的用戶(hù)組沒(méi)有投票權(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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 09:01
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
抚松县| 五家渠市| 文山县| 河东区| 金秀| 灵丘县| 绥德县| 延庆县| 平定县| 南丰县| 平江县| 阜康市| 商南县| 宝兴县| 广宁县| 林甸县| 湟源县| 贺州市| 邹平县| 平谷区| 涪陵区| 临沂市| 连南| 阳新县| 皋兰县| 右玉县| 云浮市| 平顺县| 依兰县| 从化市| 曲水县| 和林格尔县| 吉林市| 莆田市| 惠来县| 乐陵市| 辽中县| 彰化市| 两当县| 渭源县| 盐源县|