Computing weights

Authors:
Houda Abbad;Éric Laugerotte
Affiliations:
E.E.D.I.S, University of Djillali Liabes, Sidi Bel Abbes, Algeria;Normandie Univ, France,LITIS, UR, Rouen, France
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 10
Cited 0

Rational series and their languages

Rational series and their languages
Models of a K-rational identity system

Journal of Computer and System Sciences
Direct and dual laws for automata with multiplicities

Theoretical Computer Science
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Glushkov Construction for Multiplicities

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Derivatives of rational expressions and related theorems

Theoretical Computer Science - Implementation and application automata
Derivatives of rational expressions with multiplicity

Theoretical Computer Science
WeightedWord Recognition

Fundamenta Informaticae
Partial Conway and Iteration Semirings

Fundamenta Informaticae
Handbook of Weighted Automata

Handbook of Weighted Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces an efficient weighted regognition algorithm. It is based on a suitable tree structure called ZPC without building the position automaton. The ZPC-structure results from the compact language and the polynomial structure of weighted expressions. We show that the time complexity of this algorithm is the best oneuntil now.