Equivalence of finite-valued tree transducers is decidable
From MaRDI portal
Publication:4301635
DOI10.1007/BF01192143zbMath0809.68087MaRDI QIDQ4301635
No author found.
Publication date: 10 August 1994
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Related Items
Queries on XML streams with bounded delay and concurrency, Branching synchronization grammars with nested tables, Decidability of the finiteness of ranges of tree transductions, Decomposing a $k$-valued transducer into $k$ unambiguous ones
Cites Work
- Single-valuedness of tree transducers is decidable in polynomial time
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- On the valuedness of finite transducers
- Attribute grammars and recursive program schemes. I. II
- On the degree of ambiguity of finite automata
- Sur les rélations rationnelles entre monoides libres
- On the lengths of values in a finite transducer
- On the finite degree of ambiguity of finite tree automata
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- Unnamed Item
- Unnamed Item