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

Workshop on Descriptional Complexity of Formal Systems最新文献

筛选
英文 中文
The Quotient Operation on Input-Driven Pushdown Automata 输入驱动下推自动机的商运算
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_24
A. Okhotin, K. Salomaa
{"title":"The Quotient Operation on Input-Driven Pushdown Automata","authors":"A. Okhotin, K. Salomaa","doi":"10.1007/978-3-319-60252-3_24","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_24","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 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":"126452010","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
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages 由因子-，子词-和无后缀语言生成的Kuratowski代数
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_15
Jozef Jirásek, Matús Palmovský, Juraj Sebej
{"title":"Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages","authors":"Jozef Jirásek, Matús Palmovský, Juraj Sebej","doi":"10.1007/978-3-319-60252-3_15","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_15","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"40 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":"129204077","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
Uncountable Realtime Probabilistic Classes 不可数的实时概率类
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-05-04 DOI: 10.1007/978-3-319-60252-3_8
M. Dimitrijevs, A. Yakaryılmaz
{"title":"Uncountable Realtime Probabilistic Classes","authors":"M. Dimitrijevs, A. Yakaryılmaz","doi":"10.1007/978-3-319-60252-3_8","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_8","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124130847","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
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete 使用按秩并策略构建的并查找树的识别是np完全的
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-04-24 DOI: 10.1007/978-3-319-60252-3_12
Kitti Gelle, Szabolcs Iván
{"title":"Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete","authors":"Kitti Gelle, Szabolcs Iván","doi":"10.1007/978-3-319-60252-3_12","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_12","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126758153","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
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection 带交集正则表达式的偏导数自动机的状态复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_4
Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
{"title":"On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection","authors":"Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis","doi":"10.1007/978-3-319-41114-9_4","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_4","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"31 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":"125107205","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
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems 可堆性，相互作用粒子系统，偏序:结果和开放问题
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_2
Gabriel Istrate, C. Bonchis
{"title":"Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems","authors":"Gabriel Istrate, C. Bonchis","doi":"10.1007/978-3-319-41114-9_2","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_2","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":"124372677","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
Self-Verifying Finite Automata and Descriptional Complexity 自验证有限自动机与描述复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_3
Galina Jirásková
{"title":"Self-Verifying Finite Automata and Descriptional Complexity","authors":"Galina Jirásková","doi":"10.1007/978-3-319-41114-9_3","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_3","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"35 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":"121155338","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
Contextual Array Grammars with Matrix and Regular Control 具有矩阵和正则控制的上下文数组语法
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_8
H. Fernau, R. Freund, R. Siromoney, K. Subramanian
{"title":"Contextual Array Grammars with Matrix and Regular Control","authors":"H. Fernau, R. Freund, R. Siromoney, K. Subramanian","doi":"10.1007/978-3-319-41114-9_8","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_8","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"32 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":"123268495","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
Unary Self-verifying Symmetric Difference Automata 一元自验证对称差分自动机
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_14
Laurette Marais, L. V. Zijl
{"title":"Unary Self-verifying Symmetric Difference Automata","authors":"Laurette Marais, L. V. Zijl","doi":"10.1007/978-3-319-41114-9_14","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_14","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"23 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":"116455536","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
MSO-definable Properties of Muller Context-Free Languages Are Decidable 大多数上下文无关语言的mso可定义属性是可确定的
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_7
Z. Ésik, Szabolcs Iván
{"title":"MSO-definable Properties of Muller Context-Free Languages Are Decidable","authors":"Z. Ésik, Szabolcs Iván","doi":"10.1007/978-3-319-41114-9_7","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_7","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"22 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":"124608742","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
首页 上一页 下一页 尾页
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学术官方微信