Economy of description for single-valued transducers

DOI10.1006/inco.1995.1071zbMath0826.68065OpenAlexW2003113120MaRDI QIDQ1892895

Reinhard Klemm, Andreas Weber

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

zbMATH Keywords

finite automatafinite transducers

Mathematics Subject Classification ID

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

Related Items (18)

Hierarchical information and the synthesis of distributed strategies ⋮ Visibly pushdown transducers ⋮ Degree of Sequentiality of Weighted Automata ⋮ FINITELY SUBSEQUENTIAL TRANSDUCERS ⋮ An optimal pre-determinization algorithm for weighted transducers ⋮ Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton ⋮ Sequential? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Transforming a single-valued transducer into a Mealy machine ⋮ Unnamed Item ⋮ Deterministic generalized automata ⋮ Minimization algorithms for sequential transducers ⋮ Decomposing a $k$-valued transducer into $k$ unambiguous ones ⋮ A Pattern Logic for Automata with Outputs ⋮ Determinization of transducers over finite and infinite words. ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality.

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