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

Workshop on Descriptional Complexity of Formal Systems最新文献

筛选
英文 中文
The Word Problem for Finitary Automaton Groups 有限自动机群的字问题
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2023-02-21 DOI: 10.48550/arXiv.2302.10670
Maximilian Kotowsky, Jan Philipp Wächter
{"title":"The Word Problem for Finitary Automaton Groups","authors":"Maximilian Kotowsky, Jan Philipp Wächter","doi":"10.48550/arXiv.2302.10670","DOIUrl":"https://doi.org/10.48550/arXiv.2302.10670","url":null,"abstract":"A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the uniform word problem is coNP-complete. Here, the input consists of a finitary automaton together with a finite state sequence and the question is whether the sequence acts trivially on all input words. Additionally, we also show that the respective compressed word problem, where the state sequence is given as a straight-line program, is PSPACE-complete. In both cases, we give a direct reduction from the satisfiablity problem for (quantified) boolean formulae.","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126299063","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
Ranking Binary Unlabelled Necklaces in Polynomial Time 排序二进制未标记项链在多项式时间
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2022-05-27 DOI: 10.48550/arXiv.2205.13916
Duncan Adamson
{"title":"Ranking Binary Unlabelled Necklaces in Polynomial Time","authors":"Duncan Adamson","doi":"10.48550/arXiv.2205.13916","DOIUrl":"https://doi.org/10.48550/arXiv.2205.13916","url":null,"abstract":"Unlabelled Necklaces are an equivalence class of cyclic words under both the rotation (cyclic shift) and the relabelling operations. The relabelling of a word is a bijective mapping from the alphabet to itself. The main result of the paper is the first polynomial-time algorithm for ranking unlabelled necklaces of a binary alphabet. The time-complexity of the algorithm is O ( n 6 log 2 n ), where n is the length of the considered necklaces. The key part of the algorithm is to compute the rank of any word with respect to the set of unlabelled necklaces by finding three other ranks: the rank over all necklaces, the rank over symmetric unlabelled necklaces, and the rank over necklaces with an enclosing labelling. The last two concepts are introduced in this paper.","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115358835","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
Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter 具有给定因子和非重复字母的双无限幂自由词的构造
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2022-02-24 DOI: 10.1007/978-3-031-34326-1_12
Josef Rukavicka
{"title":"Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter","authors":"Josef Rukavicka","doi":"10.1007/978-3-031-34326-1_12","DOIUrl":"https://doi.org/10.1007/978-3-031-34326-1_12","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117165104","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
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups 同步最大置换群等于原始置换群
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2021-11-26 DOI: 10.1007/978-3-030-93489-7_4
Stefan Hoffmann
{"title":"Sync-Maximal Permutation Groups Equal Primitive Permutation Groups","authors":"Stefan Hoffmann","doi":"10.1007/978-3-030-93489-7_4","DOIUrl":"https://doi.org/10.1007/978-3-030-93489-7_4","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133054533","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
Commutative Regular Languages with Product-Form Minimal Automata 乘积形式最小自动机的可交换正则语言
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2021-11-26 DOI: 10.1007/978-3-030-93489-7_5
Stefan Hoffmann
{"title":"Commutative Regular Languages with Product-Form Minimal Automata","authors":"Stefan Hoffmann","doi":"10.1007/978-3-030-93489-7_5","DOIUrl":"https://doi.org/10.1007/978-3-030-93489-7_5","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116528204","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
State Complexity Investigations on Commutative Languages - The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages 可交换语言的状态复杂性研究——上下闭包、可交换非周期和可交换群语言
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2021-11-26 DOI: 10.1007/978-3-030-93489-7_6
Stefan Hoffmann
{"title":"State Complexity Investigations on Commutative Languages - The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages","authors":"Stefan Hoffmann","doi":"10.1007/978-3-030-93489-7_6","DOIUrl":"https://doi.org/10.1007/978-3-030-93489-7_6","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123521751","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
Image-Binary Automata Image-Binary自动机
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2021-09-02 DOI: 10.1007/978-3-030-93489-7_15
S. Kiefer, C. Widdershoven
{"title":"Image-Binary Automata","authors":"S. Kiefer, C. Widdershoven","doi":"10.1007/978-3-030-93489-7_15","DOIUrl":"https://doi.org/10.1007/978-3-030-93489-7_15","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584879","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
Improved constructions for succinct affine automata 简练仿射自动机的改进构造
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2021-06-30 DOI: 10.1007/978-3-030-93489-7_16
A. Yakaryılmaz
{"title":"Improved constructions for succinct affine automata","authors":"A. Yakaryılmaz","doi":"10.1007/978-3-030-93489-7_16","DOIUrl":"https://doi.org/10.1007/978-3-030-93489-7_16","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302866","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 Uniform Distribution of Regular Expressions 正则表达式的均匀分布
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2021-03-24 DOI: 10.1007/978-3-030-93489-7_2
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
{"title":"On the Uniform Distribution of Regular Expressions","authors":"Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis","doi":"10.1007/978-3-030-93489-7_2","DOIUrl":"https://doi.org/10.1007/978-3-030-93489-7_2","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130487392","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
Regular Expression Length via Arithmetic Formula Complexity 正则表达式长度通过算术公式复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2020-12-31 DOI: 10.1007/978-3-030-62536-8_3
Ehud Cseresnyes, Hannes Seiwert
{"title":"Regular Expression Length via Arithmetic Formula Complexity","authors":"Ehud Cseresnyes, Hannes Seiwert","doi":"10.1007/978-3-030-62536-8_3","DOIUrl":"https://doi.org/10.1007/978-3-030-62536-8_3","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115327254","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学术官方微信