Classification des opérateurs selon la complexité dans un système de réécriture régulier
Cyril Chabaud · HAL (Le Centre pour la Communication Scientifique Directe) · 1998
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.