Economy of description for single-valued transducers
From MaRDI portal
(Redirected from Publication:1892895)
Recommendations
Cited in
(21)- FINITELY SUBSEQUENTIAL TRANSDUCERS
- scientific article; zbMATH DE number 4047172 (Why is no real title available?)
- An optimal pre-determinization algorithm for weighted transducers
- Transforming a single-valued transducer into a Mealy machine
- scientific article; zbMATH DE number 7559138 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2201358 (Why is no real title available?)
- 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
- Visibly pushdown transducers
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- 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)
