On the valuedness of finite transducers
From MaRDI portal
Publication:1120286
DOI10.1007/BF00264285zbMath0672.68027MaRDI QIDQ1120286
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
Equivalence of finite-valued tree transducers is decidable, Single-valuedness of tree transducers is decidable in polynomial time, On the degree of ambiguity of finite automata, On the lengths of values in a finite transducer, Finite-valued distance automata, Reasoning about strings in databases, Decomposing a $k$-valued transducer into $k$ unambiguous ones