On Functionality of Visibly Pushdown Transducers

Details On Functionality of Visibly Pushdown Transducers On Functionality of Visibly Pushdown Transducers

2010-02-07

arxiv.org/abs/1002.1443v1

Computer Science

Formal Languages and Automata Theory

20 pages

Scientific paper

Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. In this paper, we prove that functionality is decidable in PSpace for visibly pushdown transducers. The proof is done via a pumping argument: if a word with two outputs has a sufficiently large nesting depth, there exists a nested word with two outputs whose nesting depth is strictly smaller. The proof uses technics of word combinatorics. As a consequence of decidability of functionality, we also show that equivalence of functional visibly pushdown transducers is Exptime-Complete.

Affiliated with

Also associated with

No associations

Rating

On Functionality of Visibly Pushdown Transducers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Functionality of Visibly Pushdown Transducers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Functionality of Visibly Pushdown Transducers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582720