Approximate problems for finite transducers
From MaRDI portal
Cites work
- A note on finite-valued and finitely ambiguous transducers
- A pattern logic for automata with outputs
- An approximate determinization algorithm for weighted finite-state automata
- Approximate determinization of quantitative automata
- Classification of formal languages by functional binary transductions
- Deciding conjugacy of a rational relation (extended abstract)
- Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
- Determinization of transducers over finite and infinite words.
- Edit distance of finite state transducers
- Exact and approximate determinization of discounted-sum automata
- scientific article; zbMATH DE number 3978420 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1408334 (Why is no real title available?)
- scientific article; zbMATH DE number 6741931 (Why is no real title available?)
- Lipschitz robustness of finite-state transducers
- Multi-sequential word relations
- On equivalence and uniformisation problems for finite transducers
- Path logics for querying graphs: combining expressiveness and efficiency
- Regular combinators for string transformations
- Rigorous approximated determinization of weighted automata
- Sequential Functions
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- The many facets of string transducers (invited talk)
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
This page was built for publication: Approximate problems for finite transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397615)
