The regular languages of wire linear \(\mathrm{AC}^0\)

DOI10.1007/s00236-022-00432-2OpenAlexW4226022954MaRDI QIDQ2170278

Charles Paperman, Michaël Cadilhac

Publication date: 30 August 2022

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-022-00432-2

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular languages in \(NC\)
• The dot-depth hierarchy of star-free languages is infinite
• First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
• The Lower Reaches of Circuit Uniformity
• Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$
• Alternation Hierarchies of First Order Logic with Regular Predicates
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Some results onC-varieties
• A SYNTACTICAL PROOF OF LOCALITY OF DA
• STACS 2005

This page was built for publication: The regular languages of wire linear \(\mathrm{AC}^0\)