Language and Automata Theory and Applications最新文献

筛选
英文 中文
How to Prove that a Language Is Regular or Star-Free? 如何证明一门语言是规则的还是没有星星的?
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_5
J. Pin
{"title":"How to Prove that a Language Is Regular or Star-Free?","authors":"J. Pin","doi":"10.1007/978-3-030-40608-0_5","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_5","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":"114326741","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
Recompression: Technique for Word Equations and Compressed Data 再压缩:字方程和压缩数据的技术
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_4
Artur Jeż
{"title":"Recompression: Technique for Word Equations and Compressed Data","authors":"Artur Jeż","doi":"10.1007/978-3-030-40608-0_4","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_4","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"9 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":"134289033","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
Geometrically Closed Positive Varieties of Star-Free Languages 无星语言的几何闭正变体
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_23
O. Klíma, Peter Kostolányi
{"title":"Geometrically Closed Positive Varieties of Star-Free Languages","authors":"O. Klíma, Peter Kostolányi","doi":"10.1007/978-3-030-40608-0_23","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_23","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"79 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":"129284493","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 Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function 内积模2函数的深度二阈值电路的大小
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_16
Kazuyuki Amano
{"title":"On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function","authors":"Kazuyuki Amano","doi":"10.1007/978-3-030-40608-0_16","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_16","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"6 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":"128874895","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
Input Strictly Local Tree Transducers 输入严格本地树换能器
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_26
Jing Ji, Jeffrey Heinz
{"title":"Input Strictly Local Tree Transducers","authors":"Jing Ji, Jeffrey Heinz","doi":"10.1007/978-3-030-40608-0_26","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_26","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"49 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":"130636947","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
Reducing the Ambiguity of Parikh Matrices 减少Parikh矩阵的模糊性
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_28
Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel A. Reidenbach
{"title":"Reducing the Ambiguity of Parikh Matrices","authors":"Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel A. Reidenbach","doi":"10.1007/978-3-030-40608-0_28","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_28","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"1 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":"123218540","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
Context-Sensitive Fusion Grammars Are Universal 上下文敏感的融合语法是通用的
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_19
Aaron Lye
{"title":"Context-Sensitive Fusion Grammars Are Universal","authors":"Aaron Lye","doi":"10.1007/978-3-030-40608-0_19","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_19","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":"132350315","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
Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle 圆上环面束基本群的非标准Cayley自动表示
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_7
D. Berdinsky, Prohrak Kruengthomya
{"title":"Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle","authors":"D. Berdinsky, Prohrak Kruengthomya","doi":"10.1007/978-3-030-40608-0_7","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_7","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"21 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120848529","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
Limited Two-Way Deterministic Finite Automata with Advice 带通知的有限双向确定性有限自动机
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_15
Ahmet Bilal Uçan
{"title":"Limited Two-Way Deterministic Finite Automata with Advice","authors":"Ahmet Bilal Uçan","doi":"10.1007/978-3-030-40608-0_15","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_15","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"21 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":"126501285","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
The Power of Programs over Monoids in 程序在Monoids上的力量
Language and Automata Theory and Applications Pub Date : 2019-12-17 DOI: 10.1007/978-3-030-40608-0_22
Nathan Grosshans
{"title":"The Power of Programs over Monoids in","authors":"Nathan Grosshans","doi":"10.1007/978-3-030-40608-0_22","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_22","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116945167","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学术文献互助群
群 号:481959085
Book学术官方微信