Mar 25, 2023 · A nested word consists of a linear sequence of positions, calls, internals and returns, augmented with matching relations connecting from calls ...

Visibly pushdown automata (VPA), introduced by Alur and Madhusuan in 2004, is a subclass of pushdown automata whose stack behavior is completely determined by ...

Hence, the matchings of push (call) and pop (return) make languages with matching nested relations accepted. Nevertheless, it is limited to one-to-one matching.

Jan 16, 2021 · ... Automaton (MNTA) are defined over multi-matching nested words ... Extending Visibly Pushdown Automata over Multi-matching Nested Relations.

Multi-matching nested relation consists of a sequence of linearly ordered positions, call, internal, and return, augmented with one-to-one, ...

multi-matching nested relation n-to-one one-to-n symbolic automata visibly ... Extending Visibly Pushdown Automata over Multi-matching Nested Relations.

With this motivation, we introduce Symbolic Visibly Pushdown Automata (SVPA) as an executable model for nested words over infinite alphabets. In this model, ...

Abstract. Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of.

an under-approximation method for model-checking multi-threaded programs. Scope-bounded matching relations were introduced to extend bounded-context.