A polynomial procedure for trimming visibly pushdown automata

Mathieu Caralp (1) , Pierre-Alain Reynier (1) , Jean-Marc Talbot (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

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.

Mots clés: Visibily Pushdown Automata; Trimming

Domaines: Théorie et langage formel [cs.FL]

Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot. A polynomial procedure for trimming visibly pushdown automata. 2011. ⟨hal-00606778v2⟩