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

Language and Automata Theory and Applications最新文献

筛选
英文 中文
Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference 基于sat的最小DFA推理的高效对称破缺
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_12
I. Zakirzyanov, António Morgado, Alexey Ignatiev, V. Ulyantsev, Joao Marques-Silva
{"title":"Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference","authors":"I. Zakirzyanov, António Morgado, Alexey Ignatiev, V. Ulyantsev, Joao Marques-Silva","doi":"10.1007/978-3-030-13435-8_12","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_12","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"61 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":"115178970","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
Geometrical Closure of Binary V_3/2 Languages 二进制V_3/2语言的几何闭包
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_22
J. Dubernard, Giovanna Guaiana, L. Mignot
{"title":"Geometrical Closure of Binary V_3/2 Languages","authors":"J. Dubernard, Giovanna Guaiana, L. Mignot","doi":"10.1007/978-3-030-13435-8_22","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_22","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"21 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":"130136282","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
Orbits of Abelian Automaton Groups 阿贝尔自动机群的轨道
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_5
T. Becker, Klaus Sutner
{"title":"Orbits of Abelian Automaton Groups","authors":"T. Becker, Klaus Sutner","doi":"10.1007/978-3-030-13435-8_5","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_5","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"72 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":"129345512","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
An Oracle Hierarchy for Small One-Way Finite Automata 小型单向有限自动机的Oracle层次结构
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_4
M. Anabtawi, Sabit Hassan, Christos A. Kapoutsis, M. Zakzok
{"title":"An Oracle Hierarchy for Small One-Way Finite Automata","authors":"M. Anabtawi, Sabit Hassan, Christos A. Kapoutsis, M. Zakzok","doi":"10.1007/978-3-030-13435-8_4","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_4","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"35 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":"126976533","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
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata 线性高阶元胞自动机灵敏度和等连续性的可判定性
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_7
A. Dennunzio, E. Formenti, L. Manzoni, L. Margara, A. Porreca
{"title":"Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata","authors":"A. Dennunzio, E. Formenti, L. Manzoni, L. Margara, A. Porreca","doi":"10.1007/978-3-030-13435-8_7","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_7","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":"126701855","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
Generalized Register Context-Free Grammars 广义寄存器上下文无关语法
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_19
Ryoma Senda, Y. Takata, H. Seki
{"title":"Generalized Register Context-Free Grammars","authors":"Ryoma Senda, Y. Takata, H. Seki","doi":"10.1007/978-3-030-13435-8_19","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_19","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"66 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":"116609812","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
Recurrence in Multidimensional Words 多维词的递归
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_29
É. Charlier, S. Puzynina, Élise Vandomme
{"title":"Recurrence in Multidimensional Words","authors":"É. Charlier, S. Puzynina, Élise Vandomme","doi":"10.1007/978-3-030-13435-8_29","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_29","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"19 811 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":"122621479","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
From Words to Graphs, and Back 从文字到图表，再回来
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_3
V. Lozin
{"title":"From Words to Graphs, and Back","authors":"V. Lozin","doi":"10.1007/978-3-030-13435-8_3","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_3","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"27 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":"114225771","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
Toroidal Codes and Conjugate Pictures 环面码与共轭图
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_21
M. Anselmo, Maria Madonia, Carla Selmi
{"title":"Toroidal Codes and Conjugate Pictures","authors":"M. Anselmo, Maria Madonia, Carla Selmi","doi":"10.1007/978-3-030-13435-8_21","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_21","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"41 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":"127406160","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
Complexity of Regex Crosswords Regex纵横字谜的复杂性
Language and Automata Theory and Applications Pub Date : 2019-03-26 DOI: 10.1007/978-3-030-13435-8_16
Stephen A. Fenner, Daniel Padé
{"title":"Complexity of Regex Crosswords","authors":"Stephen A. Fenner, Daniel Padé","doi":"10.1007/978-3-030-13435-8_16","DOIUrl":"https://doi.org/10.1007/978-3-030-13435-8_16","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"20 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":"130487409","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
首页 上一页 下一页 尾页
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学术官方微信