Language and Automata Theory and Applications最新文献

筛选
英文 中文
Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects 重塑上下文无关模型:语言和算法方面
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_4
E. Shamir
{"title":"Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects","authors":"E. Shamir","doi":"10.1007/978-3-319-77313-1_4","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_4","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"24 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":"133488717","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
Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets 网的受限子类的过逼近Petri网综合
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_23
U. Schlachter
{"title":"Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets","authors":"U. Schlachter","doi":"10.1007/978-3-319-77313-1_23","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_23","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"5 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":"131056166","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}
引用次数: 11
Descriptional and Computational Complexity of the Circuit Representation of Finite Automata 有限自动机电路表示的描述和计算复杂度
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_8
Maris Valdats
{"title":"Descriptional and Computational Complexity of the Circuit Representation of Finite Automata","authors":"Maris Valdats","doi":"10.1007/978-3-319-77313-1_8","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_8","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"119 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":"122902282","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
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects 禁止模式格路径的解析组合:枚举方面
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_15
Andrei Asinowski, A. Bacher, C. Banderier, Bernhard Gittenberger
{"title":"Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects","authors":"Andrei Asinowski, A. Bacher, C. Banderier, Bernhard Gittenberger","doi":"10.1007/978-3-319-77313-1_15","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_15","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"14 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":"132194593","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}
引用次数: 11
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy PSPACE与多项式层次完全问题正则交空性的确定
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_12
Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf
{"title":"Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy","authors":"Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf","doi":"10.1007/978-3-319-77313-1_12","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_12","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"11 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":"125061298","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}
引用次数: 7
Formal Languages over GF(2) 基于GF的形式语言(2)
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_5
Ekaterina Bakinova, A. Basharin, Igor Batmanov, Konstantin Lyubort, A. Okhotin, Elizaveta Sazhneva
{"title":"Formal Languages over GF(2)","authors":"Ekaterina Bakinova, A. Basharin, Igor Batmanov, Konstantin Lyubort, A. Okhotin, Elizaveta Sazhneva","doi":"10.1007/978-3-319-77313-1_5","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_5","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"14 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":"130767244","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}
引用次数: 16
Disturbance Decoupling in Finite Automata 有限自动机的扰动解耦
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_9
A. Zhirabok, A. Shumsky
{"title":"Disturbance Decoupling in Finite Automata","authors":"A. Zhirabok, A. Shumsky","doi":"10.1007/978-3-319-77313-1_9","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_9","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"41 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":"128714279","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
Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi Semiring 利用Viterbi半环正确有效地处理Viterbi训练中的关系
Language and Automata Theory and Applications Pub Date : 2018-04-09 DOI: 10.1007/978-3-319-77313-1_22
Markus Saers, Dekai Wu
{"title":"Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi Semiring","authors":"Markus Saers, Dekai Wu","doi":"10.1007/978-3-319-77313-1_22","DOIUrl":"https://doi.org/10.1007/978-3-319-77313-1_22","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"1 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":"131310384","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学术文献互助群
群 号:604180095
Book学术官方微信
小红书