arXiv - CS - Formal Languages and Automata Theory最新文献_第2页

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions 将瓦格纳层次理论扩展到 $k$ 分区的复杂性问题

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI: arxiv-2409.06977

Vladimir Podolskii, Victor Selivanov

引用次数: 0

A New Notion of Regularity: Finite State Automata Accepting Graphs 规律性的新概念：接受图的有限状态自动机

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI: arxiv-2409.06968

Yvo Ad MeeresUniversity of Bremen, Germany

{"title":"A New Notion of Regularity: Finite State Automata Accepting Graphs","authors":"Yvo Ad MeeresUniversity of Bremen, Germany","doi":"arxiv-2409.06968","DOIUrl":"https://doi.org/arxiv-2409.06968","url":null,"abstract":"Analogous to regular string and tree languages, regular languages of directed\u0000acyclic graphs (DAGs) are defined in the literature. Although called regular,\u0000those DAG-languages are more powerful and, consequently, standard problems have\u0000a higher complexity than in the string case. Top-down as well as bottom-up\u0000deterministic DAG languages are subclasses of the regular DAG languages. We\u0000refine this hierarchy by providing a weaker subclass of the deterministic DAG\u0000languages. For a DAG grammar generating a language in this new DAG language\u0000class, or, equivalently, a DAG-automaton recognizing it, a classical\u0000deterministic finite state automaton (DFA) can be constructed. As the main\u0000result, we provide a characterization of this class. The motivation behind this is the transfer of techniques for regular string\u0000languages to graphs. Trivially, our restricted DAG language class is closed\u0000under union and intersection. This permits the application of minimization and\u0000hyper-minimization algorithms known for DFAs. This alternative notion of\u0000regularity coins at the existence of a DFA for recognizing a DAG language.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"2013 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197190","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

Operational State Complexity of Block Languages 区块语言的运行状态复杂性

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI: arxiv-2409.06970

Guilherme DuarteCMUP & FCUP, Nelma MoreiraCMUP & FCUP, Luca PrigionieroUniversity of Loughborough, Rogério ReisCMUP & FCUP

引用次数: 0

Repetitive Finite Automata With Translucent Letters 带半透明字母的重复有限自动机

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI: arxiv-2409.06975

František MrázCharles University at Prague, Friedrich OttoUniversity of Kassel

引用次数: 0

Complexity of Unary Exclusive Nondeterministic Finite Automata 一元排他性非确定有限自动机的复杂性

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI: arxiv-2409.06967

Martin KutribInstitut für Informatik, Universität Giessen, Andreas MalcherInstitut für Informatik, Universität Giessen, Matthias WendlandtInstitut für Informatik, Universität Giessen

{"title":"Complexity of Unary Exclusive Nondeterministic Finite Automata","authors":"Martin KutribInstitut für Informatik, Universität Giessen, Andreas MalcherInstitut für Informatik, Universität Giessen, Matthias WendlandtInstitut für Informatik, Universität Giessen","doi":"arxiv-2409.06967","DOIUrl":"https://doi.org/arxiv-2409.06967","url":null,"abstract":"Exclusive nondeterministic finite automata (XNFA) are nondeterministic finite\u0000automata with a special acceptance condition. An input is accepted if there is\u0000exactly one accepting path in its computation tree. If there are none or more\u0000than one accepting paths, the input is rejected. We study the descriptional\u0000complexity of XNFA accepting unary languages. While the state costs for mutual\u0000simulations with DFA and NFA over general alphabets differ significantly from\u0000the known types of finite automata, it turns out that the state costs for the\u0000simulations in the unary case are in the order of magnitude of the general\u0000case. In particular, the state costs for the simulation of an XNFA by a DFA or\u0000an NFA are $e^{theta(sqrt{n cdot ln{n}})}$. Conversely, converting an NFA to\u0000an equivalent XNFA may cost $e^{theta(sqrt{n cdot ln{n}})}$ states as well.\u0000All bounds obtained are also tight in the order of magnitude. Finally, we\u0000investigate the computational complexity of different decision problems for\u0000unary XNFA and it is shown that the problems of emptiness, universality,\u0000inclusion, and equivalence are coNP-complete, whereas the general membership\u0000problem is NL-complete.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142225205","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

5' -> 3' Watson-Crick Automata accepting Necklaces 5' -> 3' 沃森-克里克自动机接受项链

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI: arxiv-2409.06976

Benedek NagyEastern Mediterranean University, Famagusta and Eszterházy Károly Catholic University, Eger

{"title":"5' -> 3' Watson-Crick Automata accepting Necklaces","authors":"Benedek NagyEastern Mediterranean University, Famagusta and Eszterházy Károly Catholic University, Eger","doi":"arxiv-2409.06976","DOIUrl":"https://doi.org/arxiv-2409.06976","url":null,"abstract":"Watson-Crick (WK) finite automata work on a Watson-Crick tape representing a\u0000DNA molecule. They have two reading heads. In 5'->3' WK automata, the heads\u0000move and read the input in opposite physical directions. In this paper, we\u0000consider such inputs which are necklaces, i.e., they represent circular DNA\u0000molecules. In sensing 5'->3' WK automata, the computation on the input is\u0000finished when the heads meet. As the original model is capable of accepting the\u0000linear context-free languages, the necklace languages we are investigating here\u0000have strong relations to that class. Here, we use these automata in two\u0000different acceptance modes. On the one hand, in weak acceptance mode the heads\u0000are starting nondeterministically at any point of the input, like the necklace\u0000is cut at a nondeterministically chosen point), and if the input is accepted,\u0000it is in the accepted necklace language. These languages can be seen as the\u0000languages obtained from the linear context-free languages by taking their\u0000closure under cyclic shift operation. On the other hand, in strong acceptance\u0000mode, it is required that the input is accepted starting the heads in the\u0000computation from every point of the cycle. These languages can be seen as the\u0000maximal cyclic shift closed languages included in a linear language. On the\u0000other hand, as it will be shown, they have a kind of locally testable property.\u0000We present some hierarchy results based on restricted variants of the WK\u0000automata, such as stateless or all-final variants.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"2013 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197182","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

Non-Global Parikh Tree Automata 非全局帕里克树自动机

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI: arxiv-2409.06973

Luisa HerrmannTU Dresden, Johannes Osterholzer

引用次数: 0

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024) 第 14 届自动机非经典模型及应用国际研讨会（NCMA 2024）论文集

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-10 DOI: arxiv-2409.06120

Florin Manea, Giovanni Pighizzini

引用次数: 0

State estimation of timed automata under partial observation [Draft version] 部分观察下定时自动机的状态估计 [草案版]

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-09 DOI: arxiv-2409.05810

Chao Gao, Dimitri Lefebvre, Carla Seatzu, Zhiwu Li, Alessandro Giua

引用次数: 0

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability 利用假设，在部分可观测性条件下有效监控实时属性

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-09 DOI: arxiv-2409.05456

Alessandro Cimatti, Thomas M. Grosen, Kim G. Larsen, Stefano Tonetta, Martin Zimmermann

{"title":"Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability","authors":"Alessandro Cimatti, Thomas M. Grosen, Kim G. Larsen, Stefano Tonetta, Martin Zimmermann","doi":"arxiv-2409.05456","DOIUrl":"https://doi.org/arxiv-2409.05456","url":null,"abstract":"Runtime verification of temporal properties over timed sequences of\u0000observations is crucial in various applications within cyber-physical systems\u0000ranging from autonomous vehicles over smart grids to medical devices. In this\u0000paper, we are addressing the challenge of effectively predicting the failure or\u0000success of properties in a continuous real-time setting. Our approach allows\u0000predictions to exploit assumptions on the system being monitored and supports\u0000predictions of non-observable system behaviour (e.g. internal faults). More\u0000concretely, in our approach properties are expressed in Metric Interval\u0000Temporal Logic (MITL), assumptions on the monitored system are specified in\u0000terms of Timed Automata, and observations are to be provided in terms of\u0000sequences of timed constraints. We present an assumption-based runtime\u0000verification algorithm and its implementation on top of the real-time\u0000verification tool UPPAAL. We show experimentally that assumptions can be\u0000effective in anticipating the satisfaction/violation of timed properties and in\u0000handling monitoring properties that predicate over unobservable events.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197216","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