1. A simple universal cellular automaton and its one-way and totalistic version;Albert;Complex Systems,1987
2. Ensembles reconnaissables de mots bi-infinis limite et déterminisme;Beauquier,1984
3. The undecidability of the domino problem;Berger;Mem. Amer. Math. Soc.,1966
4. Transductions and Context-Free Languages;Berstel,1979
5. Adherences of languages;Boasson;J. Comput. System Sci.,1980