Algorithmic aspects of decomposition and equivalence of finite-valued transducers

DOI10.1134/S0032946015030059zbMath1367.94490MaRDI QIDQ259883

K. Yu. Gorbunova, Andrej A. 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)

Related Items (1)

On the decidability of the valuedness problem for two-way finite transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

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