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

Language and Automata Theory and Applications最新文献

筛选
英文 中文
Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions 作为子序列函数逻辑表征的布尔一元递归格式
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_10
Siddharth Bhaskar, Jane Chandlee, Adam Jardine, C. Oakden
{"title":"Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions","authors":"Siddharth Bhaskar, Jane Chandlee, Adam Jardine, C. Oakden","doi":"10.1007/978-3-030-40608-0_10","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_10","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125072764","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
Deciding Classes of Regular Languages: The Covering Approach 确定正则语言的类:覆盖方法
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_6
Thomas Place
{"title":"Deciding Classes of Regular Languages: The Covering Approach","authors":"Thomas Place","doi":"10.1007/978-3-030-40608-0_6","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_6","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"62 16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124159847","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
Complexity Issues of String to Graph Approximate Matching 字符串到图近似匹配的复杂性问题
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_17
R. Dondi, G. Mauri, I. Zoppis
{"title":"Complexity Issues of String to Graph Approximate Matching","authors":"R. Dondi, G. Mauri, I. Zoppis","doi":"10.1007/978-3-030-40608-0_17","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_17","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134160466","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
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases 加权自动机的包容与等价:概率与Max-Plus情况
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_2
Laure Daviaud
{"title":"Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases","authors":"Laure Daviaud","doi":"10.1007/978-3-030-40608-0_2","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_2","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115292014","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
Complexity of Automatic Sequences 自动序列的复杂度
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_18
H. Zantema
{"title":"Complexity of Automatic Sequences","authors":"H. Zantema","doi":"10.1007/978-3-030-40608-0_18","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_18","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121808187","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
Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models 随机模型验证中时间自动机的表达性和简洁性
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_11
S. Donatelli, S. Haddad
{"title":"Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models","authors":"S. Donatelli, S. Haddad","doi":"10.1007/978-3-030-40608-0_11","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_11","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129773335","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
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas 确定性上下文无关语言的交、并层次和抽运引理
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_24
T. Yamakami
{"title":"Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas","authors":"T. Yamakami","doi":"10.1007/978-3-030-40608-0_24","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_24","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130897847","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
Ordered Semiautomatic Rings with Applications to Geometry 有序半自动环在几何中的应用
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_9
Ziyuan Gao, Sanjay Jain, Ji-bing Qi, Philipp Schlicht, F. Stephan, Jacob Tarr
{"title":"Ordered Semiautomatic Rings with Applications to Geometry","authors":"Ziyuan Gao, Sanjay Jain, Ji-bing Qi, Philipp Schlicht, F. Stephan, Jacob Tarr","doi":"10.1007/978-3-030-40608-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_9","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122950295","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
Pebble-Intervals Automata and FOdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$^2$$end{document} with Two Orders Pebble-Intervals Automata and FOdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$^2$$end{document} with Two Orders
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_14
Nadia LabaiB, Tomer Kotek, Magdalena Ortiz, H. Veith
{"title":"Pebble-Intervals Automata and FOdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$^2$$end{document} with Two Orders","authors":"Nadia LabaiB, Tomer Kotek, Magdalena Ortiz, H. Veith","doi":"10.1007/978-3-030-40608-0_14","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_14","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"14 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132099033","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
Cyclic Shift on Multi-component Grammars 多成分语法的循环移位
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_20
A. Okhotin, A. Sorokin
{"title":"Cyclic Shift on Multi-component Grammars","authors":"A. Okhotin, A. Sorokin","doi":"10.1007/978-3-030-40608-0_20","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_20","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124325219","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学术官方微信