scientific article; zbMATH DE number 7561353

DOI10.4230/LIPIcs.FSTTCS.2018.48MaRDI QIDQ5090989

Adrien Boiret, Radosław Piórkowski, Janusz Schmude

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1806.04361

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

formal languagetransducersequivalence problemunordered treesregister automataHilbert's basis theoremMSO transformations

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items (3)

Characterizing attributed tree translations in terms of macro tree transducers ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Macro tree transducers
• A proof of Ehrenfeucht's conjecture
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Monadic second-order definable graph transductions: a survey
• A short solution for the HDT0L sequence equivalence problem
• Minimizing subsequential transducers: a survey.
• A Survey on Decidable Equivalence Problems for Tree Transducers
• Expressiveness of Streaming String Transducers
• Streaming Tree Transducers
• Macro Tree Translations of Linear Size Increase are MSO Definable
• Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
• Regular Functions and Cost Register Automata
• Mappings and grammars on trees

This page was built for publication: