Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > FO[+]:
Reports tagged with FO[+]:
TR14-177 | 14th December 2014
Andreas Krebs, Klaus-Joern Lange, Michael Ludwig

Visibly Counter Languages and Constant Depth Circuits

We examine visibly counter languages, which are languages recognized by visibly counter automata (a.k.a. input driven counter automata). We are able to effectively characterize the visibly counter languages in AC0, and show that they are contained in FO[+].

more >>>



ISSN 1433-8092 | Imprint