Rapport Année : 2011

A polynomial procedure for trimming visibly pushdown automata

Résumé

We describe a polynomial procedure which, given a visibly pushdown automaton that accepts only well-nested words, returns an equivalent visibly pushdown automaton that is trimmed. We also show that this procedure can be applied to weighted visibly pushdown automata such as visibly pushdown transducers.

Fichier principal
Vignette du fichier
trimming.pdf (98.7 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00606778 , version 1 (07-07-2011)
hal-00606778 , version 2 (29-03-2012)

Licence

Identifiants

  • HAL Id : hal-00606778 , version 2

Citer

Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot. A polynomial procedure for trimming visibly pushdown automata. 2011. ⟨hal-00606778v2⟩
290 Consultations
215 Téléchargements

Partager

  • More