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

Workshop on Descriptional Complexity of Formal Systems最新文献

筛选
英文 中文
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems 图控插入-删除系统的描述复杂性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_9
H. Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
{"title":"Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems","authors":"H. Fernau, Lakshmanan Kuppusamy, Indhumathi Raman","doi":"10.1007/978-3-319-41114-9_9","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_9","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115973560","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}
引用次数: 7
Completely Reachable Automata 完全可达自动机
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-02 DOI: 10.1007/978-3-319-41114-9_1
E. A. Bondar, Mikhail Volkov
{"title":"Completely Reachable Automata","authors":"E. A. Bondar, Mikhail Volkov","doi":"10.1007/978-3-319-41114-9_1","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_1","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"6 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128732088","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}
引用次数: 23
Operations on Weakly Recognizing Morphisms 弱识别态射的运算
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-03-17 DOI: 10.1007/978-3-319-41114-9_10
Lukas Fleischer, Manfred Kufleitner
{"title":"Operations on Weakly Recognizing Morphisms","authors":"Lukas Fleischer, Manfred Kufleitner","doi":"10.1007/978-3-319-41114-9_10","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_10","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130554505","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
Unrestricted State Complexity of Binary Operations on Regular Languages 正则语言上二进制运算的无限制状态复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-02-03 DOI: 10.1007/978-3-319-41114-9_5
J. Brzozowski
{"title":"Unrestricted State Complexity of Binary Operations on Regular Languages","authors":"J. Brzozowski","doi":"10.1007/978-3-319-41114-9_5","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_5","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132168973","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}
引用次数: 17
Compressibility of Finite Languages by Grammars 有限语言的语法可压缩性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_8
Sebastian Eberhard, Stefan Hetzl
{"title":"Compressibility of Finite Languages by Grammars","authors":"Sebastian Eberhard, Stefan Hetzl","doi":"10.1007/978-3-319-19225-3_8","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_8","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123023253","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}
引用次数: 12
The State Complexity of Permutations on Finite Languages over Binary Alphabets 有限语言二进制字母上排列的状态复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_19
Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, K. Salomaa
{"title":"The State Complexity of Permutations on Finite Languages over Binary Alphabets","authors":"Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, K. Salomaa","doi":"10.1007/978-3-319-19225-3_19","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_19","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114317958","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
Complement on Free and Ideal Languages 对自由和理想语言的补充
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_16
P. Mlynárcik
{"title":"Complement on Free and Ideal Languages","authors":"P. Mlynárcik","doi":"10.1007/978-3-319-19225-3_16","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_16","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124505396","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}
引用次数: 8
Quantum State Complexity of Formal Languages 形式语言的量子态复杂性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_24
Marcos Villagra, T. Yamakami
{"title":"Quantum State Complexity of Formal Languages","authors":"Marcos Villagra, T. Yamakami","doi":"10.1007/978-3-319-19225-3_24","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_24","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132862772","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}
引用次数: 8
Unambiguity in Automata Theory 自动机理论中的无歧义性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_1
Thomas Colcombet
{"title":"Unambiguity in Automata Theory","authors":"Thomas Colcombet","doi":"10.1007/978-3-319-19225-3_1","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_1","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132018641","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}
引用次数: 48
Square on Ideal, Closed and Free Languages 关于理想、封闭和自由的语言
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_6
Kristína Cevorová
{"title":"Square on Ideal, Closed and Free Languages","authors":"Kristína Cevorová","doi":"10.1007/978-3-319-19225-3_6","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_6","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121807155","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信