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

Workshop on Descriptional Complexity of Formal Systems最新文献

筛选
英文 中文
On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages 论树邻接语言与头语法语言的不确定性程度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_5
Suna Bensch, M. Hoeberechts
{"title":"On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages","authors":"Suna Bensch, M. Hoeberechts","doi":"10.1007/978-3-319-60252-3_5","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_5","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130385152","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
Concise Representations of Reversible Automata 可逆自动机的简明表示
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_19
G. Lavado, Luca Prigioniero
{"title":"Concise Representations of Reversible Automata","authors":"G. Lavado, Luca Prigioniero","doi":"10.1007/978-3-319-60252-3_19","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_19","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121943851","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}
引用次数: 6
Avoiding Overlaps in Pictures 避免图片重叠
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_2
M. Anselmo, D. Giammarresi, Maria Madonia
{"title":"Avoiding Overlaps in Pictures","authors":"M. Anselmo, D. Giammarresi, Maria Madonia","doi":"10.1007/978-3-319-60252-3_2","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_2","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122234171","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 and Operations - Two Non-classical Cases 描述复杂性和操作-两个非经典案例
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_3
J. Dassow
{"title":"Descriptional Complexity and Operations - Two Non-classical Cases","authors":"J. Dassow","doi":"10.1007/978-3-319-60252-3_3","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_3","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122386953","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
Applications of Transducers in Independent Languages, Word Distances, Codes 传感器在独立语言、词距离、码中的应用
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_4
S. Konstantinidis
{"title":"Applications of Transducers in Independent Languages, Word Distances, Codes","authors":"S. Konstantinidis","doi":"10.1007/978-3-319-60252-3_4","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_4","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121148007","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
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors 具有初等极化和少量处理器的进化处理器网络的计算完备性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_11
R. Freund, V. Rogojin, Sergey Verlan
{"title":"Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors","authors":"R. Freund, V. Rogojin, Sergey Verlan","doi":"10.1007/978-3-319-60252-3_11","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_11","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123045378","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}
引用次数: 2
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity 图形控制的插入-删除系统生成超越线性的语言类
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_10
H. Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
{"title":"Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity","authors":"H. Fernau, Lakshmanan Kuppusamy, Indhumathi Raman","doi":"10.1007/978-3-319-60252-3_10","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_10","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127215956","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}
引用次数: 9
State Complexity of Unary SV-XNFA with Different Acceptance Conditions 一元SV-XNFA在不同接受条件下的状态复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_20
Laurette Marais, L. V. Zijl
{"title":"State Complexity of Unary SV-XNFA with Different Acceptance Conditions","authors":"Laurette Marais, L. V. Zijl","doi":"10.1007/978-3-319-60252-3_20","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_20","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114203356","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}
引用次数: 2
A Pumping Lemma for Ordered Restarting Automata 有序重启自动机的抽运引理
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_18
K. Kwee, F. Otto
{"title":"A Pumping Lemma for Ordered Restarting Automata","authors":"K. Kwee, F. Otto","doi":"10.1007/978-3-319-60252-3_18","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_18","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127608194","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}
引用次数: 2
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets 具有周期支持的2-状态2-符号图灵机产生正则集
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_22
Turlough Neary
{"title":"2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets","authors":"Turlough Neary","doi":"10.1007/978-3-319-60252-3_22","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_22","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132218454","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
首页 上一页 下一页 尾页
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学术官方微信