( en | de | ru )

 

Disambiguation of "Arnold, André"

Author of the publication

copydeleteadd this publication to your clipboard
On the separation question for tree languages.

, , and . STACS, volume 14 of LIPIcs, page 396-407. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ernst-Christian André

Helmut André

Michael André

Dieter André

Günter André

 

Other publications of authors with the same name

The algebra of binary trees is affine complete., , , and . CoRR, (2020)Continuous Separation of Game Languages., and . Fundam. Informaticae, 81 (1-3): 19-28 (2007)Affine Completeness of Some Free Binary Algebras., , and . Fundam. Informaticae, 186 (1-4): 27-44 (2022)An Example of Use of Formal Methods to Debug an Embedded Software., , and . FME, volume 1051 of Lecture Notes in Computer Science, page 649-661. Springer, (1996)Ambiguous Classes in the Games µ-Calculus Hierarchy., and . FoSSaCS, volume 2620 of Lecture Notes in Computer Science, page 70-86. Springer, (2003)A generic approach to the control of discrete event systems., , , and . CDC/ECC, page 1-5. IEEE, (2005)Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés., and . Symposium on Programming, volume 167 of Lecture Notes in Computer Science, page 1-12. Springer, (1984)MEC: A System for Constructing and Analysis Transition Systems.. AMAST, page 81-82. Springer, (1991)Synchronized Products of Transition Systems and Their Analysis.. ICATPN, volume 1420 of Lecture Notes in Computer Science, page 26-27. Springer, (1998)p329 The µ-calculus alternation-depth hierarchy is strict on binary trees.. RAIRO Theor. Informatics Appl., 33 (4/5): 329-340 (1999)