Economy of description for single-valued transducers

DOI10.1006/INCO.1995.1071zbMATH Open0826.68065OpenAlexW2003113120MaRDI QIDQ1892895FDOQ1892895

Authors: Andreas Weber, Reinhard Klemm 

Publication date: 10 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1071

Recommendations

• Transforming a single-valued transducer into a Mealy machine
• Decomposing a $k$-valued transducer into $k$ unambiguous ones
• scientific article; zbMATH DE number 4047172

zbMATH Keywords

finite automatafinite transducers

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (21)

• FINITELY SUBSEQUENTIAL TRANSDUCERS
• Title not available (Why is that?)
• Title not available (Why is that?)
• An optimal pre-determinization algorithm for weighted transducers
• Transforming a single-valued transducer into a Mealy machine
• Deterministic generalized automata
• Hierarchical information and the synthesis of distributed strategies
• A pattern logic for automata with outputs
• Minimization algorithms for sequential transducers
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• The complexity of optimizing finite-state transducers
• Decomposing a $k$-valued transducer into $k$ unambiguous ones
• Title not available (Why is that?)
• Streamability of nested word transductions
• Degree of sequentiality of weighted automata
• Determinization of transducers over finite and infinite words.
• Sequentiality of string-to-context transducers
• Title not available (Why is that?)
• Visibly pushdown transducers
• Sequential?

This page was built for publication: Economy of description for single-valued transducers

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