Computational Processes, Observers and Turing Incompleteness TCS 412 (2011) 1-2, 183-190.
Cellular Automata, Decidability and Phase Space Fundamentae Informaticae 140 (2010) 1-20.
Model Checking One-Dimensional Cellular Automata J. Cellular Automata, 4 (2009) 3, 213-224.
Classification of Cellular Automata Encyclopedia of Complexity and System Science, ed. R. A. Meyers, Springer 2009.
Divisibility and State Complexity The Mathematica J., 11 (2009) 3, 430--445.
CDM: Teaching Discrete Mathematics to Computer Science Majors J. Educ. Resour. Comput., 5 (2005) 2, 1-11.
Universality and Cellular Automata LNCS 3354 (2005) 50-59.
The Complexity of Reversible Cellular Automata TCS 325 (2004) 317-328.
Almost Periodic Configurations on Linear Cellular Automata Fundamentae Informaticae 58/3-4 (2003), 223-240.
The Ehrenfeucht-Mycielski Sequence CIAA'03, Santa Barbara.
The Size of Power Automata Theoretical Computer Science, 295/1-3 (2003) 371--386.
Cellular Automata and Intermediate Degrees Theoretical Computer Science, 296/2 (2003) 365-375
Reduced Power Automata Proceedings CIAA 2002, J-M. Champarnaud, D. Maurel, eds., 2002, 191-200
automata, a Hybrid System for Computational Automata Theory Proceedings CIAA 2002, J-M. Champarnaud, D. Maurel, eds., 2002, 217-222
Cellular Automata and Intermediate Reachability Problems Fundamentae Informaticae 52 (2002) 1-3, 249-256
Decomposition of Additive CA Complex Systems 13 (2001) 2, 245-270
Sigma-Automata and Chebyshev Polynomials Theoretical Computer Science, 230 (2000) 49--73
Linear Cellular Automata and De Bruijn Automata M. Delorme and J. Mazoyer, eds., Cellular Automata: A Parallel Model, Kluwer, 1999
Linear Cellular Automata and Fischer Automata Parallel Computing, 23 (1997) 11, 1613--1634
Optimal Link Assignments for All-Terminal Reliability Discrete Applied Mathematics, 75 (1997), 285--295
The Lattice of beta-r.e. Sets Draft.