Bi-transductions de forêts. - André Arnold; Max Dauchet (ICALP, 1976)

Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. - André Arnold; Max Dauchet (RAIRO Theor. Informatics Appl., 1976)

Un Théorème de Duplication pour les Forêts Algébriques. - André Arnold; Max Dauchet (J. Comput. Syst. Sci., 1976)

Non Deterministic Recursive Program Schemes. - André Arnold; Maurice Nivat (FCT, 1977)

Sul l'inversion des morphisms d'arbres. - André Arnold; Max Dauchet (ICALP, 1978)

Sémantique algébrique de l'appel par valeur. - André Arnold (RAIRO Theor. Informatics Appl., 1978)

Théorie des magmoïdes. - André Arnold; Max Dauchet (RAIRO Theor. Informatics Appl., 1978)

Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. - André Arnold; Max Dauchet (Math. Syst. Theory, 1978)

Forêts Algébriques et Homomorphismes Inverses - André Arnold; Max Dauchet (Inf. Control., 1978)

Forets de Greibach et homomorphismes inverses. - André Arnold; Bernard Leguy (FCT, 1979)

Théorie des Magmoïdes (II). - André Arnold; Max Dauchet (RAIRO Theor. Informatics Appl., 1979)

A New Proof of two Theorems about Rational Transductions. - André Arnold; Michel Latteux (Theor. Comput. Sci., 1979)

Controlling Behaviours of Systems: Some Basic Concepts and some Applications. - André Arnold; Maurice Nivat (MFCS, 1980)

The metric space of infinite trees. Algebraic and topological properties. - André Arnold; Maurice Nivat (Fundam. Informaticae, 1980)

Le Théorème de Transversale Rationnelle dans les Langages d'Arbres. - André Arnold (Math. Syst. Theory, 1980)

Formal Computations of Non Deterministic Recursive Program Schemes. - André Arnold; Maurice Nivat (Math. Syst. Theory, 1980)

Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. - André Arnold; Maurice Nivat (Theor. Comput. Sci., 1980)

Une Propriété des Forêts Algébriques "de Greibach" - André Arnold; Bernard Leguy (Inf. Control., 1980)

Sémantique des Processus Communicants. - André Arnold (RAIRO Theor. Informatics Appl., 1981)

Synchronized Behaviours of Processes and Rational Relations. - André Arnold (Acta Informatica, 1982)

Morphismes et Bimorphismes d'Arbres. - André Arnold; Max Dauchet (Theor. Comput. Sci., 1982)

Topological Characterizations of Infinite Behaviours of Transition Systems. - André Arnold (ICALP, 1983)

Rational omega-Languages are Non-Ambiguous. - André Arnold (Theor. Comput. Sci., 1983)

Deterministic and non ambiguous rational omega-languages. - André Arnold (Automata on Infinite Words, 1984)

Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés. - André Arnold; Pascal Guitton (Symposium on Programming, 1984)

A Syntactic Congruence for Rational omega-Language. - André Arnold (Theor. Comput. Sci., 1985)

A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems. - André Arnold; Paul Crubillé (Inf. Process. Lett., 1988)

Logical Definability of Fixed Points. - André Arnold (Theor. Comput. Sci., 1988)

MEC: A System for Constructing and Analysing Transition Systems. - André Arnold (Automatic Verification Methods for Finite State Systems, 1989)

Recognizable sets of finite bilabelled transition systems. - André Arnold (Bull. EATCS, 1989)

An Example of Sequentialization of a Parallel Algorithm. - André Arnold (Sci. Comput. Program., 1989)

An Algebraic Characterization of Transition System Equivalences - André Arnold; Anne Dicky (Inf. Comput., 1989)

Optimal Word Chains for the Thue-Morse Word - André Arnold; Srecko Brlek (Inf. Comput., 1989)

Fixed Point Characterization of Büchi Automata on Infinite Trees. - André Arnold; Damian Niwinski (J. Inf. Process. Cybern., 1990)

MEC: A System for Constructing and Analysis Transition Systems. - André Arnold (AMAST, 1991)

Fixed point characterization of weak monadic logic definable sets of trees. - André Arnold; Damian Niwinski (Tree Automata and Languages, 1992)

A note about minimal non-deterministic automata. - André Arnold; Anne Dicky; Maurice Nivat (Bull. EATCS, 1992)

Equivalences and Preorders of Transition Systems. - André Arnold; Anne Dicky (MFCS, 1993)

Verification and Comparison of Transition Systems. - André Arnold (TAPSOFT, 1993)

Finite transition systems - semantics of communicating systems. - André Arnold (Prentice Hall, 1994)

Hypertransition Systems. - André Arnold (STACS, 1994)

Construction and Analysis of Transition Systems with MEC - André Arnold; Didier Bégay; Paul Crubillé (World Scientific, 1994)

A relative of the Thue-Morse sequence. - Jean-Paul Allouche; André Arnold; Jean Berstel; Srecko Brlek; William Jockusch; Simon Plouffe; Bruce E. Sagan (Discret. Math., 1995)

Automatic Verification of Properties in Transition Systems. - André Arnold; Srecko Brlek (Softw. Pract. Exp., 1995)

An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma. - André Arnold (Theor. Comput. Sci., 1995)

A Topological Property of Rational omega-Languages. - André Arnold (Theor. Comput. Sci., 1995)

The Embedded Software of an Electrical Meter: An Experiment in Using Formal Methods in an Industrial Project. - André Arnold; Didier Bégay; Jean-Pierre Radoux (AMAST, 1996)

An Example of Use of Formal Methods to Debug an Embedded Software. - André Arnold; Didier Bégay; Jean-Pierre Radoux (FME, 1996)

A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal. - Mohamed Naimi; Michel Tréhel; André Arnold (J. Parallel Distributed Comput., 1996)

An Algebraic Characterization of Observational Equivalence. - André Arnold; Ilaria Castellani (Theor. Comput. Sci., 1996)

Recognizable Subsets of the Two Letter Plactic Monoid. - André Arnold; Mathias Kanta; Daniel Krob (Inf. Process. Lett., 1997)

A Selection Property of the Boolean µ-Calculus and Some of its Applications. - André Arnold (RAIRO Theor. Informatics Appl., 1997)

The Embedded Software of an Electricity Meter: An Experience in Using Formal Methods in an Industrial Project. - André Arnold; Didier Bégay; Jean-Pierre Radoux (Sci. Comput. Program., 1997)

Synchronized Products of Transition Systems and Their Analysis. - André Arnold (ICATPN, 1998)

The AltaRica Formalism for Describing Concurrent Systems. - André Arnold; Gérald Point; Alain Griffault; Antoine Rauzy (Fundam. Informaticae, 1999)

p329 The µ-calculus alternation-depth hierarchy is strict on binary trees. - André Arnold (RAIRO Theor. Informatics Appl., 1999)

The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. - André Arnold; Giacomo Lenzi; Jerzy Marcinkowski (LICS, 2001)

Nivat's processes and their synchronization. - André Arnold (Theor. Comput. Sci., 2002)

On Ambiguous Classes in the mu-Calculus Hierarchy of Tree Languages. - André Arnold; Luigi Santocanale (FICS, 2003)

Ambiguous Classes in the Games µ-Calculus Hierarchy. - André Arnold; Luigi Santocanale (FoSSaCS, 2003)

Games for synthesis of controllers with partial observation. - André Arnold; Aymeric Vincent; Igor Walukiewicz (Theor. Comput. Sci., 2003)

A generic approach to the control of discrete event systems. - André Arnold; Xavier Briand; Gérald Point; Aymeric Vincent (CDC/ECC, 2005)

Ambiguous classes in mu-calculi hierarchies. - Luigi Santocanale; André Arnold (Theor. Comput. Sci., 2005)

Continuous Separation of Game Languages. - André Arnold; Damian Niwinski (Fundam. Informaticae, 2007)

On the topological complexity of tree languages. - André Arnold; Jacques Duparc; Filip Murlak; Damian Niwinski (Logic and Automata, 2008)

Nondeterministic controllers of nondeterministic processes. - André Arnold; Igor Walukiewicz (Logic and Automata, 2008)

On the Separation Question for Tree Languages. - André Arnold; Henryk Michalewski; Damian Niwinski (Theory Comput. Syst., 2014)

A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. - André Arnold; Damian Niwinski; Pawel Parys (CSL, 2021)

The algebra of binary trees is affine complete. - André Arnold; Patrick Cégielski; Serge Grigorieff; Irène Guessarian (Discret. Math. Theor. Comput. Sci., 2021)

Affine Completeness of Some Free Binary Algebras. - André Arnold; Patrick Cégielski; Irène Guessarian (Fundam. Informaticae, 2022)