Formal language characterizations of P, NP, and PSPACE, J. of Automata, Languages and Combinatorics, vol.13, issue.34, pp.161-183, 2008. ,
Weak Second-Order Arithmetic and Finite Automata, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.9, issue.1-6, pp.66-92, 1960. ,
DOI : 10.1002/malq.19600060105
Cellular automata: A parallel model, Mathematics and Its Applications, 1998. ,
DOI : 10.1007/978-94-015-9153-9
First-order queries on structures of bounded degree are computable with constant delay, ACM Transactions on Computational Logic, pp.1-18, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00195016
Finite Model Theory, 1995. ,
Two-Dimensional Languages, pp.215-267, 1997. ,
DOI : 10.1007/978-3-642-59126-6_4
URL : https://hal.archives-ouvertes.fr/hal-00541890
Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems, Information and Computation, vol.125, issue.1, pp.32-45, 1996. ,
DOI : 10.1006/inco.1996.0018
URL : http://doi.org/10.1006/inco.1996.0018
Finite Model Theory and Its Applications. Texts in Theoretical Computer Science, 2007. ,
Descriptive Complexity. Graduate Texts in Computer Science, 1999. ,
Recognizable picture languages and domino tiling, Theoretical Computer Science, vol.178, issue.1-2, 1994. ,
DOI : 10.1016/S0304-3975(96)00283-6
URL : http://doi.org/10.1016/s0304-3975(96)00283-6
Elements of Finite Model Theory, 2004. ,
DOI : 10.1007/978-3-662-07003-1
A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES, International Journal of Foundations of Computer Science, vol.19, issue.01, pp.205-217, 2008. ,
DOI : 10.1142/S0129054108005632
Parallel language recognition in constant time by cellular automata, Acta Informatica, vol.3, issue.4, pp.397-407, 1983. ,
DOI : 10.1007/BF00290736
Language recognition by cellular automata Section 1, Cellular Automata, Handbook of Natural Computing, 2011. ,