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

Language and Automata Theory and Applications最新文献

筛选
英文 中文
Learning Mealy Machines with One Timer 用一个计时器学习磨粉机
Language and Automata Theory and Applications Pub Date : 2023-02-01 DOI: 10.1007/978-3-030-68195-1_13
F. Vaandrager, R. Bloem, M. Ebrahimi
{"title":"Learning Mealy Machines with One Timer","authors":"F. Vaandrager, R. Bloem, M. Ebrahimi","doi":"10.1007/978-3-030-68195-1_13","DOIUrl":"https://doi.org/10.1007/978-3-030-68195-1_13","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127965334","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
On Hardest Languages for One-Dimensional Cellular Automata 一维元胞自动机的最难语言
Language and Automata Theory and Applications Pub Date : 2022-03-01 DOI: 10.1007/978-3-030-68195-1_10
Mikhail Mrykhin, A. Okhotin
{"title":"On Hardest Languages for One-Dimensional Cellular Automata","authors":"Mikhail Mrykhin, A. Okhotin","doi":"10.1007/978-3-030-68195-1_10","DOIUrl":"https://doi.org/10.1007/978-3-030-68195-1_10","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123459162","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
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata 双向确定性有限自动机到无二义有限自动机的转换
Language and Automata Theory and Applications Pub Date : 2021-02-22 DOI: 10.1007/978-3-030-68195-1_7
S. Petrov, A. Okhotin
{"title":"On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata","authors":"S. Petrov, A. Okhotin","doi":"10.1007/978-3-030-68195-1_7","DOIUrl":"https://doi.org/10.1007/978-3-030-68195-1_7","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124210735","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 Language Varieties Without Boolean Operations 关于没有布尔运算的语言变体
Language and Automata Theory and Applications Pub Date : 2020-11-13 DOI: 10.1007/978-3-030-68195-1_1
Fabian Birkmann, Stefan Milius, Henning Urbat
{"title":"On Language Varieties Without Boolean Operations","authors":"Fabian Birkmann, Stefan Milius, Henning Urbat","doi":"10.1007/978-3-030-68195-1_1","DOIUrl":"https://doi.org/10.1007/978-3-030-68195-1_1","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131670619","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
Efficient Pattern Matching in Elastic-Degenerate Texts 弹性简并文本中的有效模式匹配
Language and Automata Theory and Applications Pub Date : 2020-08-11 DOI: 10.1007/978-3-319-53733-7_9
C. Iliopoulos, Ritu Kundu, S. Pissis
{"title":"Efficient Pattern Matching in Elastic-Degenerate Texts","authors":"C. Iliopoulos, Ritu Kundu, S. Pissis","doi":"10.1007/978-3-319-53733-7_9","DOIUrl":"https://doi.org/10.1007/978-3-319-53733-7_9","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128439605","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}
引用次数: 24
The Automatic Baire Property and an Effective Property of ømega-Rational Functions 巨有理函数的自动贝尔性质及一个有效性质
Language and Automata Theory and Applications Pub Date : 2020-03-04 DOI: 10.1007/978-3-030-40608-0_21
O. Finkel
{"title":"The Automatic Baire Property and an Effective Property of ømega-Rational Functions","authors":"O. Finkel","doi":"10.1007/978-3-030-40608-0_21","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_21","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121448557","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 New Complexity Landscape Around Circuit Minimization 围绕电路最小化的新复杂性景观
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_1
E. Allender
{"title":"The New Complexity Landscape Around Circuit Minimization","authors":"E. Allender","doi":"10.1007/978-3-030-40608-0_1","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_1","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"95 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":"115586134","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}
引用次数: 17
Approaching Arithmetic Theories with Finite-State Automata 用有限状态自动机逼近算法理论
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_3
Christoph Haase
{"title":"Approaching Arithmetic Theories with Finite-State Automata","authors":"Christoph Haase","doi":"10.1007/978-3-030-40608-0_3","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_3","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"58 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":"127712583","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
documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$langle mathbb {R}, +,<,1 rangle $$end{document} Is Decidable in d documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$langle mathbb {R}, +,<,1 rangle $$end{document} Is Decidable in d
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_8
Alexis Bès, C. Choffrut
{"title":"documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$langle mathbb {R}, +,<,1 rangle $$end{document} Is Decidable in d","authors":"Alexis Bès, C. Choffrut","doi":"10.1007/978-3-030-40608-0_8","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_8","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":"117069038","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
Alternating Finite Automata with Limited Universal Branching 有限泛分支交替有限自动机
Language and Automata Theory and Applications Pub Date : 2020-01-07 DOI: 10.1007/978-3-030-40608-0_13
C. Keeler, K. Salomaa
{"title":"Alternating Finite Automata with Limited Universal Branching","authors":"C. Keeler, K. Salomaa","doi":"10.1007/978-3-030-40608-0_13","DOIUrl":"https://doi.org/10.1007/978-3-030-40608-0_13","url":null,"abstract":"","PeriodicalId":244792,"journal":{"name":"Language and Automata Theory and Applications","volume":"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":"134263156","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学术官方微信