双向交替自动机的改进补码

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2022-01-21 DOI:10.1007/s00236-021-00414-w

Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok

引用次数: 1

摘要

对于每个具有s个状态的双向交替有限自动机(a fa) a，我们直接构建一个具有\(O(s^6)\)状态的a fa \(A^c \)，该状态接受a不接受的输入。这改进了之前最著名的结构，该结构既昂贵又复杂，因为它需要\(O(s^7)\)状态，并涉及构建和模拟中间线性有界自动机。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Improved complement for two-way alternating automata

查看原文本刊更多论文

Improved complement for two-way alternating automata

For each two-way alternating finite automaton (a fa) A with s states, we directly build a a fa \(A^c \) with \(O(s^6)\) states which accepts exactly those inputs that are not accepted by A. This improves upon the previously best-known construction, which was both more expensive and more complicated, as it required \(O(s^7)\) states and involved building and simulating an intermediate linear-bounded automaton.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.