有线线性AC\（^0）的正则语言

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

Acta Informatica Pub Date : 2022-07-25 DOI:10.1007/s00236-022-00432-2

Michaël Cadilhac, Charles Paperman

引用次数: 0

摘要

在本文中，有线线性\（\hbox｛AC｝^0）的正则语言被刻画为可在具有正则谓词的一阶逻辑的双变量片段中表达的语言，\（\mathrm｛FO｝^2[\mathrm｛reg｝]\）。此外，它们被描述为代数类\（\mathbf｛QLDA｝\）所识别的语言。该类被证明是可判定的，并给出了类内外语言的例子。

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

$The regular languages of wire linear AC$^0$$

查看原文本刊更多论文

The regular languages of wire linear AC$^0$

In this paper, the regular languages of wire linear $\hbox {AC}^0$are characterized as the languages expressible in the two-variable fragment of first-order logic with regular predicates, $\mathrm{FO}^2[\mathrm{reg}]$. Additionally, they are characterized as the languages recognized by the algebraic class $\mathbf {QLDA}$. The class is shown to be decidable and examples of languages in and outside of it are presented.

求助全文

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

来源期刊

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.