default search action
André Arnold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j44]André Arnold, Patrick Cégielski, Irène Guessarian:
Affine Completeness of Some Free Binary Algebras. Fundam. Informaticae 186(1-4): 27-44 (2022) - 2021
- [j43]André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
The algebra of binary trees is affine complete. Discret. Math. Theor. Comput. Sci. 23(2) (2021) - [c24]André Arnold, Damian Niwinski, Pawel Parys
:
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. CSL 2021: 9:1-9:23 - [i2]André Arnold, Patrick Cégielski, Irène Guessarian:
Affine completeness of some free binary algebras. CoRR abs/2106.12846 (2021) - 2020
- [i1]André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
The algebra of binary trees is affine complete. CoRR abs/2011.03925 (2020)
2010 – 2019
- 2014
- [j42]André Arnold, Henryk Michalewski, Damian Niwinski:
On the Separation Question for Tree Languages. Theory Comput. Syst. 55(4): 833-855 (2014) - 2012
- [c23]André Arnold, Henryk Michalewski, Damian Niwinski:
On the separation question for tree languages. STACS 2012: 396-407
2000 – 2009
- 2008
- [c22]André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski:
On the topological complexity of tree languages. Logic and Automata 2008: 9-28 - [c21]André Arnold, Igor Walukiewicz:
Nondeterministic controllers of nondeterministic processes. Logic and Automata 2008: 29-52 - 2007
- [j41]André Arnold, Damian Niwinski:
Continuous Separation of Game Languages. Fundam. Informaticae 81(1-3): 19-28 (2007) - 2005
- [j40]Luigi Santocanale
Ambiguous classes in mu-calculi hierarchies. Theor. Comput. Sci. 333(1-2): 265-296 (2005) - [c20]André Arnold, Xavier Briand, Gérald Point, Aymeric Vincent:
A generic approach to the control of discrete event systems. CDC/ECC 2005: 1-5 - 2003
- [j39]André Arnold, Aymeric Vincent, Igor Walukiewicz:
Games for synthesis of controllers with partial observation. Theor. Comput. Sci. 303(1): 7-34 (2003) - [c19]André Arnold, Luigi Santocanale:
On Ambiguous Classes in the mu-Calculus Hierarchy of Tree Languages. FICS 2003: 4-13 - [c18]André Arnold, Luigi Santocanale:
Ambiguous Classes in the Games µ-Calculus Hierarchy. FoSSaCS 2003: 70-86 - 2002
- [j38]André Arnold:
Nivat's processes and their synchronization. Theor. Comput. Sci. 281(1-2): 31-36 (2002) - 2001
- [c17]André Arnold, Giacomo Lenzi, Jerzy Marcinkowski:
The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. LICS 2001: 157-166
1990 – 1999
- 1999
- [j37]André Arnold, Gérald Point, Alain Griffault, Antoine Rauzy:
The AltaRica Formalism for Describing Concurrent Systems. Fundam. Informaticae 40(2-3): 109-124 (1999) - [j36]André Arnold:
p329 The µ-calculus alternation-depth hierarchy is strict on binary trees. RAIRO Theor. Informatics Appl. 33(4/5): 329-340 (1999) - 1998
- [c16]André Arnold:
Synchronized Products of Transition Systems and Their Analysis. ICATPN 1998: 26-27 - 1997
- [j35]André Arnold, Mathias Kanta, Daniel Krob:
Recognizable Subsets of the Two Letter Plactic Monoid. Inf. Process. Lett. 64(2): 53-59 (1997) - [j34]André Arnold:
A Selection Property of the Boolean µ-Calculus and Some of its Applications. RAIRO Theor. Informatics Appl. 31(4): 371-384 (1997) - [j33]André Arnold, Didier Bégay, Jean-Pierre Radoux:
The Embedded Software of an Electricity Meter: An Experience in Using Formal Methods in an Industrial Project. Sci. Comput. Program. 28(2-3): 93-110 (1997) - 1996
- [j32]Mohamed Naimi, Michel Tréhel, André Arnold:
A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal. J. Parallel Distributed Comput. 34(1): 1-13 (1996) - [j31]André Arnold, Ilaria Castellani
An Algebraic Characterization of Observational Equivalence. Theor. Comput. Sci. 156(1&2): 289-299 (1996) - [c15]André Arnold, Didier Bégay, Jean-Pierre Radoux:
The Embedded Software of an Electrical Meter: An Experiment in Using Formal Methods in an Industrial Project. AMAST 1996: 19-32 - [c14]André Arnold, Didier Bégay, Jean-Pierre Radoux:
An Example of Use of Formal Methods to Debug an Embedded Software. FME 1996: 649-661 - 1995
- [j30]Jean-Paul Allouche
A relative of the Thue-Morse sequence. Discret. Math. 139(1-3): 455-461 (1995) - [j29]André Arnold, Srecko Brlek:
Automatic Verification of Properties in Transition Systems. Softw. Pract. Exp. 25(6): 579-596 (1995) - [j28]André Arnold:
An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma. Theor. Comput. Sci. 148(1): 121-132 (1995) - [j27]André Arnold:
A Topological Property of Rational omega-Languages. Theor. Comput. Sci. 151(1): 29-36 (1995) - 1994
- [b2]André Arnold:
Finite transition systems - semantics of communicating systems. Prentice Hall international series in computer science, Prentice Hall 1994, ISBN 978-0-13-092990-7, pp. I-VII, 1-177 - [b1]André Arnold, Didier Bégay, Paul Crubillé:
Construction and Analysis of Transition Systems with MEC. AMAST Series in Computing 3, World Scientific 1994, ISBN 978-981-02-1922-2, pp. 1-200 - [c13]André Arnold:
Hypertransition Systems. STACS 1994: 327-338 - 1993
- [c12]André Arnold, Anne Dicky:
Equivalences and Preorders of Transition Systems. MFCS 1993: 20-31 - [c11]André Arnold:
Verification and Comparison of Transition Systems. TAPSOFT 1993: 121-135 - 1992
- [j26]André Arnold, Anne Dicky, Maurice Nivat:
A note about minimal non-deterministic automata. Bull. EATCS 47: 166-169 (1992) - [p1]André Arnold, Damian Niwinski:
Fixed point characterization of weak monadic logic definable sets of trees. Tree Automata and Languages 1992: 159-188 - 1991
- [c10]André Arnold:
MEC: A System for Constructing and Analysis Transition Systems. AMAST 1991: 81-82 - 1990
- [j25]André Arnold, Damian Niwinski:
Fixed Point Characterization of Büchi Automata on Infinite Trees. J. Inf. Process. Cybern. 26(8/9): 451-459 (1990) - [e1]André Arnold:
CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings. Lecture Notes in Computer Science 431, Springer 1990, ISBN 3-540-52590-4 [contents]
1980 – 1989
- 1989
- [j24]André Arnold:
Recognizable sets of finite bilabelled transition systems. Bull. EATCS 38: 123-134 (1989) - [j23]André Arnold, Anne Dicky:
An Algebraic Characterization of Transition System Equivalences. Inf. Comput. 82(2): 198-229 (1989) - [j22]André Arnold, Srecko Brlek:
Optimal Word Chains for the Thue-Morse Word. Inf. Comput. 83(2): 140-151 (1989) - [j21]André Arnold:
An Example of Sequentialization of a Parallel Algorithm. Sci. Comput. Program. 13(1): 111-116 (1989) - [c9]André Arnold:
MEC: A System for Constructing and Analysing Transition Systems. Automatic Verification Methods for Finite State Systems 1989: 117-132 - 1988
- [j20]André Arnold, Paul Crubillé:
A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems. Inf. Process. Lett. 29(2): 57-66 (1988) - [j19]André Arnold:
Logical Definability of Fixed Points. Theor. Comput. Sci. 61: 289-297 (1988) - 1985
- [j18]André Arnold:
A Syntactic Congruence for Rational omega-Language. Theor. Comput. Sci. 39: 333-335 (1985) - 1984
- [c8]André Arnold:
Deterministic and non ambiguous rational omega-languages. Automata on Infinite Words 1984: 18-27 - [c7]André Arnold, Pascal Guitton:
Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés. Symposium on Programming 1984: 1-12 - 1983
- [j17]André Arnold:
Rational omega-Languages are Non-Ambiguous. Theor. Comput. Sci. 26: 221-223 (1983) - [c6]André Arnold:
Topological Characterizations of Infinite Behaviours of Transition Systems. ICALP 1983: 28-38 - 1982
- [j16]André Arnold:
Synchronized Behaviours of Processes and Rational Relations. Acta Informatica 17: 21-29 (1982) - [j15]André Arnold, Max Dauchet:
Morphismes et Bimorphismes d'Arbres. Theor. Comput. Sci. 20: 33-93 (1982) - 1981
- [j14]André Arnold:
Sémantique des Processus Communicants. RAIRO Theor. Informatics Appl. 15(2): 103-139 (1981) - 1980
- [j13]André Arnold, Maurice Nivat:
The metric space of infinite trees. Algebraic and topological properties. Fundam. Informaticae 3(4): 445-476 (1980) - [j12]André Arnold, Bernard Leguy:
Une Propriété des Forêts Algébriques "de Greibach". Inf. Control. 46(2): 108-134 (1980) - [j11]André Arnold, Maurice Nivat:
Formal Computations of Non Deterministic Recursive Program Schemes. Math. Syst. Theory 13: 219-236 (1980) - [j10]André Arnold:
Le Théorème de Transversale Rationnelle dans les Langages d'Arbres. Math. Syst. Theory 13: 275-282 (1980) - [j9]André Arnold, Maurice Nivat:
Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. Theor. Comput. Sci. 11: 181-205 (1980) - [c5]André Arnold, Maurice Nivat:
Controlling Behaviours of Systems: Some Basic Concepts and some Applications. MFCS 1980: 113-122
1970 – 1979
- 1979
- [j8]André Arnold, Max Dauchet:
Théorie des Magmoïdes (II). RAIRO Theor. Informatics Appl. 13(2): 135-154 (1979) - [j7]André Arnold, Michel Latteux:
A New Proof of two Theorems about Rational Transductions. Theor. Comput. Sci. 8: 261-263 (1979) - [c4]André Arnold, Bernard Leguy:
Forets de Greibach et homomorphismes inverses. FCT 1979: 31-37 - 1978
- [j6]André Arnold, Max Dauchet:
Forêts Algébriques et Homomorphismes Inverses. Inf. Control. 37(2): 182-196 (1978) - [j5]André Arnold:
Sémantique algébrique de l'appel par valeur. RAIRO Theor. Informatics Appl. 12(2): 69-82 (1978) - [j4]André Arnold, Max Dauchet:
Théorie des magmoïdes. RAIRO Theor. Informatics Appl. 12(3): 235-257 (1978) - [j3]André Arnold, Max Dauchet:
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. Math. Syst. Theory 12: 103-128 (1978) - [c3]André Arnold, Max Dauchet:
Sul l'inversion des morphisms d'arbres. ICALP 1978: 26-35 - 1977
- [c2]André Arnold, Maurice Nivat:
Non Deterministic Recursive Program Schemes. FCT 1977: 12-21 - 1976
- [j2]André Arnold, Max Dauchet:
Transductions de Forets Reconnaissables Monadiques Forets Coregulieres. RAIRO Theor. Informatics Appl. 10(1): 5-28 (1976) - [j1]André Arnold, Max Dauchet:
Un Théorème de Duplication pour les Forêts Algébriques. J. Comput. Syst. Sci. 13(2): 223-244 (1976) - [c1]André Arnold, Max Dauchet:
Bi-transductions de forêts. ICALP 1976: 74-86
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: