发布求助
文献互助 智能选刊 最新文献

Workshop on Descriptional Complexity of Formal Systems最新文献

筛选
英文 中文
Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata 交替有限自动机的有限并行性与不确定性的结合
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2020-08-24 DOI: 10.1007/978-3-030-62536-8_8
C. Keeler, K. Salomaa
{"title":"Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata","authors":"C. Keeler, K. Salomaa","doi":"10.1007/978-3-030-62536-8_8","DOIUrl":"https://doi.org/10.1007/978-3-030-62536-8_8","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123454911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
State Complexity of Suffix Distance 后缀距离的状态复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-09-01 DOI: 10.1007/978-3-319-60252-3_23
T. Ng, D. Rappaport, K. Salomaa
{"title":"State Complexity of Suffix Distance","authors":"T. Ng, D. Rappaport, K. Salomaa","doi":"10.1007/978-3-319-60252-3_23","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_23","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131448992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? 绝热量子计算如何适应量子自动机理论?
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_22
T. Yamakami
{"title":"How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?","authors":"T. Yamakami","doi":"10.1007/978-3-030-23247-4_22","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_22","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116250935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Classes of Regular Languages Related to Monotone WQOs 单调WQOs相关的正则语言类研究
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_18
Mizuhito Ogawa, V. Selivanov
{"title":"On Classes of Regular Languages Related to Monotone WQOs","authors":"Mizuhito Ogawa, V. Selivanov","doi":"10.1007/978-3-030-23247-4_18","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_18","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121454849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Limited Automata: Properties, Complexity and Variants 有限自动机:属性、复杂性和变体
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_4
G. Pighizzini
{"title":"Limited Automata: Properties, Complexity and Variants","authors":"G. Pighizzini","doi":"10.1007/978-3-030-23247-4_4","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_4","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128757227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity 输入驱动下推自动机的有限不确定性:可判决性和复杂性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_12
Yo-Sub Han, Sang-Ki Ko, K. Salomaa
{"title":"Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity","authors":"Yo-Sub Han, Sang-Ki Ko, K. Salomaa","doi":"10.1007/978-3-030-23247-4_12","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_12","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134331988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Nondeterminism Growth and State Complexity 非确定性增长和状态复杂性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_16
C. Keeler, K. Salomaa
{"title":"Nondeterminism Growth and State Complexity","authors":"C. Keeler, K. Salomaa","doi":"10.1007/978-3-030-23247-4_16","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_16","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121452238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Descriptional Complexity of Iterated Uniform Finite-State Transducers 迭代均匀有限状态传感器的描述复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_17
Martin Kutrib, Andreas Malcher, C. Mereghetti, Beatrice Palano
{"title":"Descriptional Complexity of Iterated Uniform Finite-State Transducers","authors":"Martin Kutrib, Andreas Malcher, C. Mereghetti, Beatrice Palano","doi":"10.1007/978-3-030-23247-4_17","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_17","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127867541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
State Complexity of Single-Word Pattern Matching in Regular Languages 正则语言中单字模式匹配的状态复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_6
J. Brzozowski, Sylvie Davies, A. Madan
{"title":"State Complexity of Single-Word Pattern Matching in Regular Languages","authors":"J. Brzozowski, Sylvie Davies, A. Madan","doi":"10.1007/978-3-030-23247-4_6","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_6","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121285595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A General Framework for Sequential Grammars with Control Mechanisms 具有控制机制的顺序语法的通用框架
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2019-07-17 DOI: 10.1007/978-3-030-23247-4_1
R. Freund
{"title":"A General Framework for Sequential Grammars with Control Mechanisms","authors":"R. Freund","doi":"10.1007/978-3-030-23247-4_1","DOIUrl":"https://doi.org/10.1007/978-3-030-23247-4_1","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128084326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信