Name
Abstract | ||
|---|---|---|
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 AC(0) and show that they are contained in FO[+]. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.4230/LIPIcs.STACS.2015.594 | Leibniz International Proceedings in Informatics |
Keywords | DocType | Volume |
visibly counter automata,constant depth circuits,AC0,FO[ plus ] | Journal | 30 |
ISSN | Citations | PageRank |
1868-8969 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Krebs | 1 | 0 | 0.34 |
| Klaus-Jörn Lange | 2 | 0 | 0.34 |
| Michael Ludwig | 3 | 3 | 1.80 |