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

Language and Automata Theory and Applications最新文献

筛选
英文 中文
Complete Variable-Length Codes: An Excursion into Word Edit Operations 完全变长码:对Word编辑操作的介绍
Language and Automata Theory and Applications Pub Date : 2019-12-05 DOI: 10.1007/978-3-030-40608-0_31
Jean N'eraud
{"title":"Complete Variable-Length Codes: An Excursion into Word Edit Operations","authors":"Jean N'eraud","doi":"10.1007/978-3-030-40608-0_31","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_31","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133307435","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
Windable Heads and Recognizing NL with Constant Randomness 可弯曲头与恒随机NL识别
Language and Automata Theory and Applications Pub Date : 2019-12-03 DOI: 10.1007/978-3-030-40608-0_12
M. U. Gezer
{"title":"Windable Heads and Recognizing NL with Constant Randomness","authors":"M. U. Gezer","doi":"10.1007/978-3-030-40608-0_12","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_12","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124473457","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
Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words 林登词与反林登词:对后缀和边界词的查询
Language and Automata Theory and Applications Pub Date : 2019-11-02 DOI: 10.1007/978-3-030-40608-0_27
P. Bonizzoni, C. Felice, R. Zaccagnino, Rosalba Zizza
{"title":"Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words","authors":"P. Bonizzoni, C. Felice, R. Zaccagnino, Rosalba Zizza","doi":"10.1007/978-3-030-40608-0_27","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_27","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131323337","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
Temporal Logics with Language Parameters 具有语言参数的时间逻辑
Language and Automata Theory and Applications Pub Date : 2019-10-25 DOI: 10.1007/978-3-030-68195-1_14
J. Gutsfeld, M. Müller-Olm, Christian Dielitz
{"title":"Temporal Logics with Language Parameters","authors":"J. Gutsfeld, M. Müller-Olm, Christian Dielitz","doi":"10.1007/978-3-030-68195-1_14","DOIUrl":"https://doi.org/10.1007/978-3-030-68195-1_14","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116332010","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 the Weisfeiler-Leman Dimension of Fractional Packing 关于分数填充的Weisfeiler-Leman维数
Language and Automata Theory and Applications Pub Date : 2019-10-24 DOI: 10.1007/978-3-030-40608-0_25
V. Arvind, Frank Fuhlbrück, J. Köbler, O. Verbitsky
{"title":"On the Weisfeiler-Leman Dimension of Fractional Packing","authors":"V. Arvind, Frank Fuhlbrück, J. Köbler, O. Verbitsky","doi":"10.1007/978-3-030-40608-0_25","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_25","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121868313","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
Optimal Bounds for Computing alpha α -gapped Repeats 计算α -间隙重复序列的最优界
Language and Automata Theory and Applications Pub Date : 2019-07-10 DOI: 10.1007/978-3-319-30000-9_19
M. Crochemore, R. Kolpakov, G. Kucherov
{"title":"Optimal Bounds for Computing alpha α -gapped Repeats","authors":"M. Crochemore, R. Kolpakov, G. Kucherov","doi":"10.1007/978-3-319-30000-9_19","DOIUrl":"https://doi.org/10.1007/978-3-319-30000-9_19","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126320452","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
On Collapsing Prefix Normal Words 关于前缀正常词的折叠
Language and Automata Theory and Applications Pub Date : 2019-05-28 DOI: 10.1007/978-3-030-40608-0_29
Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka
{"title":"On Collapsing Prefix Normal Words","authors":"Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka","doi":"10.1007/978-3-030-40608-0_29","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_29","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127114543","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
Transformation of Petri Nets into Context-Dependent Fusion Grammars Petri网到上下文相关融合语法的转换
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_18
H. Kreowski, Sabine Kuske, Aaron Lye
{"title":"Transformation of Petri Nets into Context-Dependent Fusion Grammars","authors":"H. Kreowski, Sabine Kuske, Aaron Lye","doi":"10.1007/978-3-030-13435-8_18","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_18","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125500377","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
State Complexity of Pseudocatenation 伪认证的状态复杂性
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_15
L. Kari, T. Ng
{"title":"State Complexity of Pseudocatenation","authors":"L. Kari, T. Ng","doi":"10.1007/978-3-030-13435-8_15","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_15","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115020113","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
Modern Aspects of Complexity Within Formal Languages 形式语言中复杂性的现代方面
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_1
H. Fernau
{"title":"Modern Aspects of Complexity Within Formal Languages","authors":"H. Fernau","doi":"10.1007/978-3-030-13435-8_1","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_1","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124887850","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学术官方微信