Multi-sequential word relations
From MaRDI portal
Publication:4640041
Recommendations
Cites work
- 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 3523154 (Why is no real title available?)
- A note on finite-valued and finitely ambiguous transducers
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- Degree of sequentiality of weighted automata
- Determinization of transducers over finite and infinite words.
- Elements of automata theory. Translated from the French by Reuben Thomas
- FINITELY SUBSEQUENTIAL TRANSDUCERS
- Lexicographic decomposition of \(k\)-valued transducers
- On Relations Defined by Generalized Finite Automata
- On the valuedness of finite transducers
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Unambiguous automata denoting finitely sequential functions
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
Cited in
(4)
This page was built for publication: Multi-sequential word relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640041)
