| Publication | Date of Publication | Type |
|---|
| A quasi-polynomial black-box algorithm for fixed point evaluation | 2026-03-23 | Paper |
Verification and comparison of transition systems
Lecture Notes in Computer Science | 2022-11-02 | Paper |
Affine Completeness of Some Free Binary Algebras
Fundamenta Informaticae | 2022-10-07 | Paper |
The algebra of binary trees is affine complete
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
The algebra of binary trees is affine complete
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
Affine completeness of some free binary algebras
(available as arXiv preprint) | 2021-06-24 | Paper |
Affine completeness of the algebra of full binary trees
Algebra Universalis | 2021-01-14 | Paper |
| The algebra of complete binary trees is affine complete | 2020-05-18 | Paper |
On the separation question for tree languages
Theory of Computing Systems | 2015-02-05 | Paper |
| On the separation question for tree languages | 2012-08-23 | Paper |
| On the topological complexity of tree languages | 2011-03-30 | Paper |
| Nondeterministic controllers of nondeterministic processes | 2011-03-30 | Paper |
| Continuous separation of game languages | 2008-03-03 | Paper |
Ambiguous classes in \(\mu\)-calculi hierarchies
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 1956506 (Why is no real title available?) | 2003-07-30 | Paper |
Nivat's processes and their synchronization
Theoretical Computer Science | 2002-07-15 | Paper |
Rudiments of \(\mu\)-calculus
Studies in Logic and the Foundations of Mathematics | 2001-03-18 | Paper |
The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees
RAIRO - Theoretical Informatics and Applications | 2000-10-03 | Paper |
A selection property of the boolean \mu -calculus and some of its applications
RAIRO - Theoretical Informatics and Applications | 2000-05-15 | Paper |
| scientific article; zbMATH DE number 1435981 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1414303 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1333608 (Why is no real title available?) | 1999-09-19 | Paper |
An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
Theoretical Computer Science | 1997-02-28 | Paper |
A topological property of rational -languages
Theoretical Computer Science | 1997-02-27 | Paper |
An algebraic characterization of observational equivalence
Theoretical Computer Science | 1997-02-27 | Paper |
A relative of the Thue-Morse sequence
Discrete Mathematics | 1996-06-19 | Paper |
| scientific article; zbMATH DE number 854569 (Why is no real title available?) | 1996-03-11 | Paper |
Construction and Analysis of Transition Systems with MEC
AMAST Series in Computing | 1995-10-18 | Paper |
| scientific article; zbMATH DE number 475417 (Why is no real title available?) | 1994-08-28 | Paper |
| scientific article; zbMATH DE number 557977 (Why is no real title available?) | 1994-04-27 | Paper |
| scientific article; zbMATH DE number 139604 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 58314 (Why is no real title available?) | 1992-09-27 | Paper |
An extension of the notions of traces and of asynchronous automata
RAIRO - Theoretical Informatics and Applications | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4201644 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4189200 (Why is no real title available?) | 1990-01-01 | Paper |
Optimal word chains for the Thue-Morse word
Information and Computation | 1989-01-01 | Paper |
An algebraic characterization of transition system equivalences
Information and Computation | 1989-01-01 | Paper |
An example of sequentialization of a parallel algorithm
Science of Computer Programming | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4121455 (Why is no real title available?) | 1989-01-01 | Paper |
A linear algorithm to solve fixed-point equations on transition systems
Information Processing Letters | 1988-01-01 | Paper |
Logical definability of fixed points
Theoretical Computer Science | 1988-01-01 | Paper |
A syntactic congruence for rational -languages
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3990900 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3924117 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3862445 (Why is no real title available?) | 1984-01-01 | Paper |
Rational \(\omega\)-languages are non-ambiguous
Theoretical Computer Science | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3814995 (Why is no real title available?) | 1983-01-01 | Paper |
Morphismes et bimorphismes d'arbres
Theoretical Computer Science | 1982-01-01 | Paper |
Synchronized behaviours of processes and rational relations
Acta Informatica | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3856434 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3812967 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3725688 (Why is no real title available?) | 1981-01-01 | Paper |
Formal computations of non deterministic recursive program schemes
Mathematical Systems Theory | 1980-01-01 | Paper |
Metric interpretations of infinite trees and semantics of non deterministic recursive programs
Theoretical Computer Science | 1980-01-01 | Paper |
Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
Information and Control | 1980-01-01 | Paper |
Le théorème de transversale rationnelle dans les langages d'arbres
Mathematical Systems Theory | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3709584 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3696510 (Why is no real title available?) | 1980-01-01 | Paper |
A new proof of two theorems about rational transductions
Theoretical Computer Science | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3692668 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3646312 (Why is no real title available?) | 1979-01-01 | Paper |
Forêts Algébriques et Homomorphismes Inverses
Information and Control | 1978-01-01 | Paper |
Recursivite et cônes rationnels fermés par intersection
Calcolo | 1978-01-01 | Paper |
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
Mathematical Systems Theory | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3607504 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3765113 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3630188 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3736996 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3599500 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3589705 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3757736 (Why is no real title available?) | 1978-01-01 | Paper |
Un théorème de Chomsky-Schützenberger pour les forets algébriques
Calcolo | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3562469 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3570368 (Why is no real title available?) | 1977-01-01 | Paper |
Un théorème de duplication pour les forets algébriques
Journal of Computer and System Sciences | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3566209 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3310101 (Why is no real title available?) | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3339442 (Why is no real title available?) | 1970-01-01 | Paper |
