Minimizing subsequential transducers: a survey.
From MaRDI portal
Publication:1853736
DOI10.1016/S0304-3975(01)00219-5zbMath1063.68065MaRDI QIDQ1853736
Publication date: 22 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Unnamed Item, REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS, COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN, Largest common prefix of a regular tree language, Subsequential transducers: a coalgebraic perspective, Definability results for top-down tree transducers, Some properties of Ising automata, Sequential?, A Survey on Decidable Equivalence Problems for Tree Transducers, Coalgebraising Subsequential Transducers, Reducing Acyclic Cover Transducers
Cites Work
- The suffix tree of a tree and minimizing sequential transducers
- Sur une variante des fonctions séquentielles
- Minimization algorithms for sequential transducers
- On the computational power of pushdown automata
- Computing the prefix of an automaton
- Minimization of Rational Word Functions
- A Characterization of Machine Mappings
- Unnamed Item
- Unnamed Item
- Unnamed Item