scientific article; zbMATH DE number 6146490

DOI10.4230/LIPIcs.STACS.2008.1324zbMath1259.68113MaRDI QIDQ4910755

Rodrigo de Souza, Jacques Sakarovitch

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4bb9.html

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

zbMATH Keywords

rational relation\(k\)-valued transducercovering of automataunambiguous transducer

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45)

Related Items (8)

Equivalence Checking Problem for Finite State Transducers over Semigroups ⋮ Word-mappings of level 2 ⋮ Lexicographic decomposition of \(k\)-valued transducers ⋮ On the Decidability of the Equivalence for k-Valued Transducers ⋮ Limited Non-determinism Hierarchy of Counter Automata ⋮ Unnamed Item ⋮ On the Decidability of the Equivalence for a Certain Class of Transducers ⋮ Algorithmic aspects of decomposition and equivalence of finite-valued transducers

This page was built for publication: