文章基本信息
- 标题：Visibly Counter Languages and Constant Depth Circuits
- 本地全文：下载
- 作者：Andreas Krebs ; Klaus-Joern Lange ; Michael Ludwig 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2014
- 卷号：2014
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
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[+].
- 关键词：AC0 ; FO[+] ; Visibly counter automata
