Equivalence of Finite-Valued Symbolic Finite Transducers

DOI10.1007/978-3-319-41579-6_21zbMATH Open1461.68106OpenAlexW2495442256MaRDI QIDQ3179179

Margus Veanes, Nikolaj Bjørner

Publication date: 21 December 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41579-6_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On some decidable properties of finite state translations
• Symbolic finite state transducers
• The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications

Related Items (2)

Balance of many-valued transductions and equivalence problems ⋮ Symmetric transrationals: the data type and the algorithmic degree of its equational theory

Uses Software

• Saner

This page was built for publication: Equivalence of Finite-Valued Symbolic Finite Transducers

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