| 2005 |
| 14 | EE | François Blanchard,
Julien Cervelle,
Enrico Formenti:
Some results about the chaotic behavior of cellular automata.
Theor. Comput. Sci. 349(3): 318-336 (2005) |
| 2003 |
| 13 | EE | François Blanchard,
Julien Cervelle,
Enrico Formenti:
Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies.
MFCS 2003: 228-238 |
| 1998 |
| 12 | EE | François Blanchard,
Petr Kurka:
Language Complexity of Rotations and Sturmian Sequences.
Theor. Comput. Sci. 209(1-2): 179-193 (1998) |
| 1996 |
| 11 | EE | François Blanchard,
Alejandro Maass:
Dynamical Behaviour of Coven's Aperiodic Cellular Automata.
Theor. Comput. Sci. 163(1&2): 291-302 (1996) |
| 1995 |
| 10 | | François Blanchard,
Alejandro Maass:
On Dynamical Properties of Generalized Toggle Automata.
LATIN 1995: 84-98 |
| 1994 |
| 9 | | François Blanchard,
S. Fabre:
Quelques procédés engendrant des suites infinies.
Theor. Comput. Sci. 123(1): 55-60 (1994) |
| 1993 |
| 8 | EE | Robert Dupuis,
Claude Thomasset,
Louis-Claude Paquin,
François Blanchard:
Towards a Methodology for the Validation of Expert Systems: The Case of Loge-Expert.
ICAIL 1993: 66-71 |
| 1991 |
| 7 | EE | Louis-Claude Paquin,
François Blanchard,
Claude Thomasset:
Loge-Expert: From a Legal Expert System to an Information System for Non-Lawyers.
ICAIL 1991: 254-259 |
| 1990 |
| 6 | | Claude Thomasset,
François Blanchard,
Louis-Claude Paquin:
Legal knowledge elicitation: from textual databases to expert systems.
DEXA 1990: 167-172 |
| 1989 |
| 5 | | François Blanchard:
beta-Expansions and Symbolic Dynamics.
Theor. Comput. Sci. 65(2): 131-141 (1989) |
| 4 | | François Blanchard:
Codes Engendrant Certains Systemes Sofiques.
Theor. Comput. Sci. 68(3): 253-265 (1989) |
| 1986 |
| 3 | | François Blanchard,
Servet Martínez A.:
Points d'Orbite Dense de Certains Langages de Mots Infinis.
Theor. Comput. Sci. 44: 107-110 (1986) |
| 2 | | François Blanchard,
Georges Hansel:
Systèmes Codés.
Theor. Comput. Sci. 44: 17-49 (1986) |
| 1984 |
| 1 | | François Blanchard,
Georges Hansel:
Languages and subshifts.
Automata on Infinite Words 1984: 138-146 |