Equivalence of Deterministic Nested Word to Word Transducers

DOI10.1007/978-3-642-03409-1_28zbMath1252.68184OpenAlexW1570372713WikidataQ62047348 ScholiaQ62047348MaRDI QIDQ3183621

Grégoire Laurence, Aurélien Lemay, Sławek Staworko, Joachim Niehren

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_28

zbMATH Keywords

XMLautomatacontext-free grammarstreestransducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (6)

Equivalence of Linear Tree Transducers with Output in the Free Group ⋮ Visibly Pushdown Transducers with Look-Ahead ⋮ Colored nested words ⋮ Visibly pushdown transducers ⋮ Streaming ranked-tree-to-string transducers ⋮ Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

This page was built for publication: Equivalence of Deterministic Nested Word to Word Transducers