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

arXiv: Formal Languages and Automata Theory最新文献

筛选
英文 中文
Matrix approach to synchronizing automata 同步自动机的矩阵方法
arXiv: Formal Languages and Automata Theory Pub Date : 2019-04-13 DOI: 10.13140/RG.2.2.12464.66566
A. Trahtman
{"title":"Matrix approach to synchronizing automata","authors":"A. Trahtman","doi":"10.13140/RG.2.2.12464.66566","DOIUrl":"https://doi.org/10.13140/RG.2.2.12464.66566","url":null,"abstract":"A word $w$ of letters on edges of underlying graph $Gamma$ of deterministic finite automaton (DFA) is called synchronizing if $w$ sends all states of the automaton to a unique state. \u0000J. Cerny discovered in 1964 a sequence of $n$-state complete DFA possessing a minimal synchronizing word of length $(n-1)^2$. The hypothesis, well known today as Cerny conjecture, claims that $(n-1)^2$ is a precise upper bound on the length of such a word for every complete $n$-state DFA. The hypothesis was formulated patently by Starke in 1966. \u0000Some matrix approach to the problem is supposed and we consider a special class of matrices of mapping induced by words in the alphabet of letters on edges of the underlying graph.","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126984337","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 short proof that O_2 is an MCFL O_2是MCFL的简短证明
arXiv: Formal Languages and Automata Theory Pub Date : 2016-03-01 DOI: 10.18653/v1/P16-1106
M. Nederhof
{"title":"A short proof that O_2 is an MCFL","authors":"M. Nederhof","doi":"10.18653/v1/P16-1106","DOIUrl":"https://doi.org/10.18653/v1/P16-1106","url":null,"abstract":"We present a new proof that $O_2$ is a multiple context-free language. It contrasts with a recent proof by Salvati (2015) in its avoidance of concepts that seem specific to two-dimensional geometry, such as the complex exponential function. Our simple proof creates realistic prospects of widening the results to higher dimensions. This finding is of central importance to the relation between extreme free word order and classes of grammars used to describe the syntax of natural language.","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132607749","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
Logic and Branching Automata 逻辑和分支自动机
arXiv: Formal Languages and Automata Theory Pub Date : 2015-07-10 DOI: 10.2168/LMCS-11(4:2)2015
Bedon Nicolas
{"title":"Logic and Branching Automata","authors":"Bedon Nicolas","doi":"10.2168/LMCS-11(4:2)2015","DOIUrl":"https://doi.org/10.2168/LMCS-11(4:2)2015","url":null,"abstract":"In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation. Then we define a logic, named P-MSO as it is a extension of monadic second-order logic with Presburger arithmetic, and show that it is precisely as expressive as branching automata. As a consequence of the effectiveness of the construction of one formalism from the other, the P-MSO theory of the class of all finite N-free posets is decidable.","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131735640","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
The length of a minimal synchronizing word and the Černy conjecture 最小同步字的长度和Černy猜想
arXiv: Formal Languages and Automata Theory Pub Date : 2014-05-10 DOI: 10.13140/RG.2.2.20208.66561
A. Trahtman
{"title":"The length of a minimal synchronizing word and the Černy conjecture","authors":"A. Trahtman","doi":"10.13140/RG.2.2.20208.66561","DOIUrl":"https://doi.org/10.13140/RG.2.2.20208.66561","url":null,"abstract":"A word w of letters on edges of underlying graph Gamma of deterministic finite automaton (DFA) is called the synchronizing word if w sends all states of the automaton to a unique state. J. Cerny discovered in 1964 a sequence of n-state complete DFA possessing a minimal synchronizing word of length (n-1)^2. The hypothesis, well known today as the Cerny conjecture, claims that it is also precise upper bound on the length of such a word for a complete DFA. This simple-looking conjecture is arguably the most fascinating and longstanding open problem in the combinatorial theory of finite automata. \u0000An attempt to prove the Cerny conjecture is wrong.","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129891862","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
Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, TTATT 2013, Hanoi, Vietnam, 19/10/2013 第二届树形自动机和树形换能器国际研讨会论文集，TTATT 2013，河内，2013年10月19日
arXiv: Formal Languages and Automata Theory Pub Date : 2013-11-20 DOI: 10.4204/EPTCS.134
S. Maneth
{"title":"Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, TTATT 2013, Hanoi, Vietnam, 19/10/2013","authors":"S. Maneth","doi":"10.4204/EPTCS.134","DOIUrl":"https://doi.org/10.4204/EPTCS.134","url":null,"abstract":"This volume contains the papers that were presented at the second international workshop on Trends in Tree Automata and Transducers (TTATT 2013) which took place on October 19th, 2013 in Hanoi/Vietnam. The workshop was colocated with the verification conference ATVA. The first edition of the workshop was colocated with RTA and took place in Nagoya/Japan. The interest of the workshop lies at the intersection of programming languages, verification, and database theory, which are areas to which tree automata and transducers are applied recently.","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130675846","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
Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires 第十八届元胞自动机与离散复杂系统国际研讨会暨第三届元胞自动机国际研讨会论文集
arXiv: Formal Languages and Automata Theory Pub Date : 2012-08-13 DOI: 10.4204/EPTCS.90
E. Formenti
{"title":"Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires","authors":"E. Formenti","doi":"10.4204/EPTCS.90","DOIUrl":"https://doi.org/10.4204/EPTCS.90","url":null,"abstract":"This volume contains the proceedings of the 18th International workshop AUTOMATA and the 3rd international symposium JAC. \u0000AUTOMATA workshop series aims at gathering researchers from all over the world working in fundamental aspects of cellular automata and related discrete complex systems. Topics cover (although they are not limited to): dynamics, topological, ergodic and algebraic aspects, algorithmic and complexity issues, emergent properties, formal language processing, symbolic dynamics, models of parallelism and distributed systems, phenomenological descriptions, scientific modeling and practical applications. JAC (Journ'ees Automates Cellulaires) is a bi-annual symposium covering the same topics and was created to have a very high standard international conference in the domain. This one will be the third event of the series after Uzes (2008, France), Turku (2010, Finland).","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131374103","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
Proceedings 8th International Conference Words 2011 2011年第8届国际词汇会议论文集
arXiv: Formal Languages and Automata Theory Pub Date : 2011-08-17 DOI: 10.4204/EPTCS.63
P. Ambrovz, vStvep'an Holub, Z. Mas'akov'a
{"title":"Proceedings 8th International Conference Words 2011","authors":"P. Ambrovz, vStvep'an Holub, Z. Mas'akov'a","doi":"10.4204/EPTCS.63","DOIUrl":"https://doi.org/10.4204/EPTCS.63","url":null,"abstract":"WORDS is the main international event in Combinatorics on Words. It is a biannual conference devoted to research of words (i.e., finite or infinite sequences of symbols over a finite alphabet) from combinatorial, algebraic and algorithmic points of view. The emphasis of the conference is on mathematical theory of words but the conference is also open to applications, mainly in computer science, biology, linguistics and physics, gaining from the fact that words arise as a natural object in many areas. \u0000The eighth edition of the conference was organized in Prague from 12th to 16th September 2011 as a joint undertaking of the Czech Technical University and the Charles University. This volume consists of contributed papers accepted for presentation at the conference and summaries of invited lectures.","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623210","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
Proceedings 12th International Workshop on Verification of Infinite-State Systems 第十二届无穷态系统验证国际研讨会论文集
arXiv: Formal Languages and Automata Theory Pub Date : 2010-10-28 DOI: 10.4204/EPTCS.39
Yu-Fang Chen, Ahmed Rezine
{"title":"Proceedings 12th International Workshop on Verification of Infinite-State Systems","authors":"Yu-Fang Chen, Ahmed Rezine","doi":"10.4204/EPTCS.39","DOIUrl":"https://doi.org/10.4204/EPTCS.39","url":null,"abstract":"The aim of the INFINITY workshop is to provide a forum for researchers interested in the development of formal methods and algorithmic techniques for the analysis of systems with infinitely many states, and their application in automated verification of complex software and hardware systems.","PeriodicalId":410586,"journal":{"name":"arXiv: Formal Languages and Automata Theory","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130304070","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学术官方微信