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

Language and Automata Theory and Applications最新文献

筛选
英文 中文
Observation and Interaction - Invited Paper 观察与互动-特邀论文
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_2
Edward A. Lee
{"title":"Observation and Interaction - Invited Paper","authors":"Edward A. Lee","doi":"10.1007/978-3-030-13435-8_2","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_2","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"227 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":"132607314","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
Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables 带上下文变量的压缩树模式的正则匹配与包含
Language and Automata Theory and Applications Pub Date : 2019-03-25 DOI: 10.1007/978-3-030-13435-8_25
Iovka Boneva, Joachim Niehren, Momar Sakho
{"title":"Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables","authors":"Iovka Boneva, Joachim Niehren, Momar Sakho","doi":"10.1007/978-3-030-13435-8_25","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_25","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372361","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
Tight Bounds on the Minimum Size of a Dynamic Monopoly 动态垄断企业最小规模的紧边界
Language and Automata Theory and Applications Pub Date : 2018-12-28 DOI: 10.1007/978-3-030-13435-8_28
Ahad N. Zehmakan
{"title":"Tight Bounds on the Minimum Size of a Dynamic Monopoly","authors":"Ahad N. Zehmakan","doi":"10.1007/978-3-030-13435-8_28","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_28","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"340 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122644529","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}
引用次数: 10
Learning Unions of k-Testable Languages k-可测试语言的学习并集
Language and Automata Theory and Applications Pub Date : 2018-12-19 DOI: 10.1007/978-3-030-13435-8_24
Alexis Linard, C. D. L. Higuera, F. Vaandrager
{"title":"Learning Unions of k-Testable Languages","authors":"Alexis Linard, C. D. L. Higuera, F. Vaandrager","doi":"10.1007/978-3-030-13435-8_24","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_24","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"424 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114724414","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
Efficient Representation and Counting of Antipower Factors in Words 词语中反幂因子的有效表示与计数
Language and Automata Theory and Applications Pub Date : 2018-12-19 DOI: 10.1007/978-3-030-13435-8_31
T. Kociumaka, J. Radoszewski, W. Rytter, Juliusz Straszynski, Tomasz Waleń, Wiktor Zuba
{"title":"Efficient Representation and Counting of Antipower Factors in Words","authors":"T. Kociumaka, J. Radoszewski, W. Rytter, Juliusz Straszynski, Tomasz Waleń, Wiktor Zuba","doi":"10.1007/978-3-030-13435-8_31","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_31","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133911506","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}
引用次数: 10
Simplified Parsing Expression Derivatives 简化解析表达式衍生物
Language and Automata Theory and Applications Pub Date : 2018-08-27 DOI: 10.1007/978-3-030-40608-0_30
Aaron Moss
{"title":"Simplified Parsing Expression Derivatives","authors":"Aaron Moss","doi":"10.1007/978-3-030-40608-0_30","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_30","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"12038 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129936865","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
Model Learning as a Satisfiability Modulo Theories Problem 模型学习作为一个可满足模理论问题
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_14
Rick Smetsers, P. Fiterau-Brostean, F. Vaandrager
{"title":"Model Learning as a Satisfiability Modulo Theories Problem","authors":"Rick Smetsers, P. Fiterau-Brostean, F. Vaandrager","doi":"10.1007/978-3-319-77313-1_14","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_14","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128642992","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}
引用次数: 18
Pomsets and Unfolding of Reset Petri Nets 重置Petri网的设置和展开
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_20
T. Chatain, M. Comlan, D. Delfieu, L. Jezequel, O. Roux
{"title":"Pomsets and Unfolding of Reset Petri Nets","authors":"T. Chatain, M. Comlan, D. Delfieu, L. Jezequel, O. Roux","doi":"10.1007/978-3-319-77313-1_20","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_20","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126547434","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
Efficient Translation with Linear Bimorphisms 线性双同构的有效翻译
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_24
Christoph Teichmann, Antoine Venant, Alexander Koller
{"title":"Efficient Translation with Linear Bimorphisms","authors":"Christoph Teichmann, Antoine Venant, Alexander Koller","doi":"10.1007/978-3-319-77313-1_24","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_24","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114859303","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 Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers 一类支持(次)顺序换能器规范化和最小化的一般单群
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_11
Stefan Gerdjikov
{"title":"A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers","authors":"Stefan Gerdjikov","doi":"10.1007/978-3-319-77313-1_11","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_11","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122665604","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
首页 上一页 下一页 尾页
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学术官方微信