Algorithmic aspects of decomposition and equivalence of finite-valued transducers

DOI10.1134/S0032946015030059zbMATH Open1367.94490MaRDI QIDQ259883FDOQ259883

K. Yu. Gorbunova, Andrej Muchnik

Publication date: 18 March 2016

Published in: Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Title not available (Why is that?)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• On the valuedness of finite transducers
• Lexicographic decomposition of \(k\)-valued transducers
• Decomposing a $k$-valued transducer into $k$ unambiguous ones
• On the Decidability of the Equivalence for k-Valued Transducers
• On the Decidability of Bounded Valuedness for Transducers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• Implementation and Application of Automata
• A unified framework for disambiguating finite transductions
• On the decidability of the valuedness problem for two-way finite transducers
• On equivalence and uniformisation problems for finite transducers
• Title not available (Why is that?)
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Algorithmic aspects of decomposition and equivalence of finite-valued transducers

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