Trimming visibly pushdown automata

Authors:
Mathieu Caralp;Pierre-Alain Reynier;Jean-Marc Talbot
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille, UMR 7279, CNRS, Aix-Marseille Université, France;Laboratoire d'Informatique Fondamentale de Marseille, UMR 7279, CNRS, Aix-Marseille Université, France;Laboratoire d'Informatique Fondamentale de Marseille, UMR 7279, CNRS, Aix-Marseille Université, France
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 8
Cited 0

On the Determinization of Weighted Finite Automata

SIAM Journal on Computing
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton

Proceedings of the 11th Colloquium on Automata, Languages and Programming
Input-Driven Languages are Recognized in log n Space

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Adding nesting structure to words

Journal of the ACM (JACM)
Congruences for visibly pushdown languages

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
OpenNWA: a nested-word automaton library

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Visibly pushdown automata with multiplicities: finiteness and k-boundedness

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton that accepts only well-nested words, returns an equivalent visibly pushdown automaton that is trimmed. We then show how this procedure can be lifted to the setting of arbitrary VPA. Furthermore, we present a way of building, given a VPA, an equivalent VPA which is both deterministic and trimmed.