Equivalence of Deterministic Nested Word to Word Transducers
نویسندگان
چکیده
We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust. Modulo polynomial time reductions, it can be identified with 4 equivalence problems for diverse classes of deterministic non-copying order-preserving transducers. In particular, we present polynomial time back and fourth reductions to the morphism equivalence problem on context free languages, which is known to be solvable in polynomial time.
منابع مشابه
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
We show that the equivalence of deterministic linear top-down treeto-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and other document transformations. The result is based on a partial normal form that provides a basic characterization of the languages produced by linear tree-t...
متن کاملNormalization of Sequential Top-Down Tree-to-Word Transducers
We study normalization of deterministic sequential top-down tree-to-word transducers (stws), that capture the class of deterministic top-down nested-word to word transducers. We identify the subclass of earliest stws (estws) that yield unique normal forms when minimized. The main result of this paper is an effective normalization procedure for stws. It consists of two stages: we first convert a...
متن کاملProperties of Visibly Pushdown Transducers
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 sufficie...
متن کاملTowards an algebraic characterization of rational word functions
Introduction In formal language theory, several models characterize regular languages: finite au-tomata, congruences of finite index, monadic second-order logic (MSO), see e.g. [Büc60, Elg61, Tra61]. Further connections exist between monoid varieties and logical fragments of MSO, for instance aperiodic monoids have been shown to recognize exactly the word languages defined by first-order (FO) f...
متن کاملA Uniformization Theorem for Nested Word to Word Transductions
We study the class of relations implemented by nested word to word transducers (also known as visibly pushdown transducers). We show that any such relation can be uniformized by a functional relation from the same class, implemented by an unambiguous transducer. We give an exponential upper bound on the state complexity of the uniformization, improving a previous doubly exponential upper bound....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009