- Computer Science Laboratory

LIP6 1998/027

  • Reports «Classification des opérateurs selon la complexité dans un système de réécriture régulier»
  • C. Chabaud
  • 23 pages - 06/24/1998 - document en - http://www.lip6.fr/lip6/reports/1998/lip6.1998.027.ps.gz 121 Ko
  • Contact Cyril.Chabaud (at) nulllip6.fr
  • Ancien Thème : CALFOR
  • Regular tree rewriting systems identify with a representation matrix from which we make an algebraic analysis in order to evaluate the average complexity of all the system operators. Then, a joint analysis of the dominating eigenvalue and the directed graph of the representation matrix gives a classification of the system operators using the results of singularity analysis as mathematical background.