HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The Regular Languages of Wire Linear AC 0

Michaël Cadilhac 1 Charles Paperman 2
2 LINKS - Linking Dynamic Data
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189, Inria Lille - Nord Europe
Abstract : In this paper, the regular languages of wire linear AC 0 are characterized as the languages expressible in the two-variable fragment of first-order logic with regular predicates, FO 2 [reg]. Additionally, they are characterized as the languages recognized by the algebraic class QLDA. The class is shown to be decidable and examples of languages in and outside of it are presented.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Contributor : Charles Paperman Connect in order to contact the contributor
Submitted on : Sunday, December 5, 2021 - 6:12:28 PM
Last modification on : Wednesday, March 23, 2022 - 3:51:23 PM
Long-term archiving on: : Sunday, March 6, 2022 - 6:09:40 PM


Files produced by the author(s)


  • HAL Id : hal-03466451, version 1


Michaël Cadilhac, Charles Paperman. The Regular Languages of Wire Linear AC 0. 2021. ⟨hal-03466451v1⟩



Record views


Files downloads