Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
From MaRDI portal
(Redirected from Publication:1426166)
Recommendations
Cites work
- scientific article; zbMATH DE number 1949651 (Why is no real title available?)
- scientific article; zbMATH DE number 1512706 (Why is no real title available?)
- scientific article; zbMATH DE number 1773097 (Why is no real title available?)
- scientific article; zbMATH DE number 1870549 (Why is no real title available?)
- Sur une variante des fonctions séquentielles
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
Cited in
(7)- scientific article; zbMATH DE number 1949651 (Why is no real title available?)
- Ferromagnetic Wire Memory
- Lipschitz robustness of finite-state transducers
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords
- Finite state transducers with predicates and identities
- Sequentiality of string-to-context transducers
This page was built for publication: Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426166)