scientific article; zbMATH DE number 7561353

DOI10.4230/LIPICS.FSTTCS.2018.48MaRDI QIDQ5090989FDOQ5090989

Authors: 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 of this publication is not available (Why is that?)

Recommendations

• The problem of equivalent transformations for homogeneous multitape automata
• On the Transition Reduction Problem for Finite Automata
• On the equivalence problem for deterministic multitape automata and transducers
• Equivalence of transducers relative to regular languages
• On equivalence and uniformisation problems for finite transducers
• Equivalence problems for transducers with a bounded number of states
• Revisiting the equivalence problem for finite multitape automata
• On the Decidability of the Equivalence for a Certain Class of Transducers
• Algorithmic aspects of decomposition and equivalence of finite-valued transducers
• Equivalence, reduction and minimization of finite automata over semirings

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)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizing attributed tree translations in terms of macro tree transducers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090989)