Michel Coornaert

According to our database1, Michel Coornaert authored at least 15 papers between 2004 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
The Garden of Eden theorem: old and new.
CoRR, 2017

2015
Multipass automata and group word problems.
Theor. Comput. Sci., 2015

On surjunctive monoids.
Int. J. Algebra Comput., 2015

2014
Multipass automata and group word problems.
CoRR, 2014

2013
Cellular automata between sofic tree shifts.
Theor. Comput. Sci., 2013

2012
Groups, graphs, languages, automata, games and second-order monadic logic.
Eur. J. Comb., 2012

Cellular Automata on Regular Rooted Trees.
Proceedings of the Implementation and Application of Automata, 2012

2011
On the reversibility and the closed image property of linear cellular automata.
Theor. Comput. Sci., 2011

On algebraic cellular automata.
J. Lond. Math. Soc., 2011

On a Characterization of Locally Finite Groups in Terms of Linear Cellular Automata.
J. Cell. Autom., 2011

2010
Some Extensions of the Moore-Myhill Garden of Eden Theorem.
Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

2009
Cellular Automata and Groups.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

2008
A generalization of the Curtis-Hedlund theorem.
Theor. Comput. Sci., 2008

2005
Asymptotic Growth of Conjugacy Classes in Finitely-generated Free Groups.
Int. J. Algebra Comput., 2005

2004
An Upper Bound for The Growth of Conjugacy Classes in Torsion-Free Word Hyperbolic Groups.
Int. J. Algebra Comput., 2004


  Loading...