FINITELY SUBSEQUENTIAL TRANSDUCERS
From MaRDI portal
Publication:5696948
DOI10.1142/S0129054103002126zbMATH Open1101.68641MaRDI QIDQ5696948FDOQ5696948
Authors: Cyril Allauzen, Mehryar Mohri 
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1962764
- Finite transducers and rational transductions
- Publication:4941151
- scientific article; zbMATH DE number 2050927
- On the valuedness of finite transducers
- Finite state transducers
- scientific article; zbMATH DE number 1773087
- Determinization of transducers over finite and infinite words.
- Subsequential transducers: a coalgebraic perspective
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
Cites Work
- Sur une variante des fonctions séquentielles
- Minimization algorithms for sequential transducers
- A note on finite-valued and finitely ambiguous transducers
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Title not available (Why is that?)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Economy of description for single-valued transducers
- On the finite-valuedness problem for sequential machines
- A computational method for optimal control of a linear system by quadratic programming†
Cited In (23)
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- Coalgebraising subsequential transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal pre-determinization algorithm for weighted transducers
- Another representation of finite transducers over real numbers
- Fragile words and Cayley type transducers
- Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
- Finitely ambiguous and finitely sequential weighted automata over fields
- Polynomial time identification of strict prefix deterministic finite state transducers
- A disambiguation algorithm for finite automata and functional transducers
- Finite state transducers
- Multi-sequential word relations
- Title not available (Why is that?)
- Finite state transducers with predicates and identities
- On Weakly Ambiguous Finite Transducers
- Multi-sequential word relations
- Determinization of transducers over finite and infinite words.
- Minimizing subsequential transducers: a survey.
- Transducers with set output
- Finite ambiguity and finite sequentiality in weighted automata over fields
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: FINITELY SUBSEQUENTIAL TRANSDUCERS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696948)
