Source: OpenCitations

• Object grammars and bijections

  Theoretical Computer Science

  Authors : I. Dutour, J.M. Fédou

  Journal reference : Volume 290, 2003, pp. 1915-1929

  DOI : 10.1016/s0304-3975(02)00368-7

• Attribute grammars and automatic complexity analysis

  Advances in Applied Mathematics

  Authors : Marni Mishna

  Journal reference : Volume 30, 2003, pp. 189-207

  DOI : 10.1016/s0196-8858(02)00542-0

• A clustering algorithm for huge trees

  Advances in Applied Mathematics

  Authors : D. Auber , M. Delest

  Journal reference : Volume 31, 2003, pp. 46-60

  DOI : 10.1016/s0196-8858(02)00505-5

• On computing the coefficients of bivariate holonomic formal series

  Theoretical Computer Science

  Authors : P. Massazza, R. Radicioni

  Journal reference : Volume 346, 2005, pp. 418-438

  DOI : 10.1016/j.tcs.2005.08.011

• Q-grammars and wall polyominoes

  Annals of Combinatorics

  Authors : Philippe Duchon

  Journal reference : Volume 3, 1999, pp. 311-321

  DOI : 10.1007/bf01608790

• Controlled non-uniform random generation of decomposable structures

  Theoretical Computer Science

  Authors : A. Denise , Y. Ponty , M. Termier

  Journal reference : Volume 411, 2010, pp. 3527-3552

  DOI : 10.1016/j.tcs.2010.05.010

• Random generation of words of context-free languages according to the frequencies of letters

  Mathematics and Computer Science

  Authors : Alain Denise , Olivier Roques , Michel Termier

  Journal reference : Volume , 2000, pp. 113-125

  DOI : 10.1007/978-3-0348-8405-1_10

• From object grammars to ECO systems

  Theoretical Computer Science

  Authors : Enrica Duchi, Jean-Marc Fedou, Simone Rinaldi

  Journal reference : Volume 314, 2003, pp. 57-95

  DOI : 10.1016/j.tcs.2003.10.037