RAIRO - Theoretical Informatics and Applications

Title Publication Date Language Citations
Spécialisation de la suite de Sturm et sous-résultants (I)1990/01/0123
Learning deterministic regular grammars from stochastic samples in polynomial time1999/01/0121
Decision algorithms for Fibonacci-automatic Words, I: Basic results2016/01/0121
Une remarque sur les systèmes complets d'identités rationnelles1990/01/0121
FindingH-partitions efficiently2005/01/0121
On generating all solutions of generalized satisfiability problems1997/01/0120
Graphes canoniques de graphes algébriques1990/01/0120
A generator of morphisms for infinite words2006/07/0120
On Christoffel classes2005/10/1520
Measuring the problem-relevant information in input2009/04/0420
Permissive strategies: from parity games to safety games2002/07/0119
A hierarchy for circular codes2008/01/2219
Traceable Identity-Based Group Signature2016/07/0118
Theμ-calculus alternation-depth hierarchy is strict on binary trees1999/07/0118
State complexity of cyclic shift2007/12/1318
A remark on morphic sturmian words1994/01/0117
On a subclass of context-free groups1991/01/0117
A note on read-$k$ times branching programs1995/01/0117
Rewriting on cyclic structures: Equivalence between the operational and the categorical description1999/07/0116
An introduction to quantum annealing2011/01/0116
Polynomials over the reals in proofs of termination : from theory to practice2005/07/0116
Towards a theory of practice in metaheuristics design: A machine learning perspective2006/04/0115
On the decidability of semigroup freeness2012/05/2915
Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time2000/07/0115
A decision method for the recognizability of sets defined by number systems1986/01/0115
Codes et motifs1989/01/0115
Une condition impliquant toutes les identités rationnelles1995/01/0115
Polygon placement under translation and rotation1989/01/0114
Implementing term rewriting by jungle evaluation1991/01/0114
On infinitary finite length codes1986/01/0114