Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3653575 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 19761 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3523154 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1512706 (Why is no real title available?)
- A note on finite-valued and finitely ambiguous transducers
- A proof of Choffrut's theorem on subsequential functions
- Determinization of transducers over finite and infinite words.
- Economy of description for single-valued transducers
- How to decide continuity of rational functions on infinite words
- Single-valued a-transducers
- 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
(35)- The complexity of transducer synthesis from multi-sequential specifications
- scientific article; zbMATH DE number 1512706 (Why is no real title available?)
- On the Decidability of the Equivalence for a Certain Class of Transducers
- FINITELY SUBSEQUENTIAL TRANSDUCERS
- An optimal pre-determinization algorithm for weighted transducers
- scientific article; zbMATH DE number 7559164 (Why is no real title available?)
- Crisp-determinization of weighted tree automata over strong bimonoids
- Over Which Monoids is the Transducer Determinization Procedure Applicable?
- Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
- Two Effective Properties of ω-Rational Functions
- A pattern logic for automata with outputs
- On long words avoiding Zimin patterns
- Multi-sequential word relations
- Lexicographic decomposition of \(k\)-valued transducers
- On the continuity set of an Omega rational function
- The many facets of string transducers (invited talk)
- Implementation of code properties via transducers
- Regular expressions and transducers over alphabet-invariant and user-defined labels
- Equivalence checking problem for finite state transducers over semigroups
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Space-efficient bimachine construction based on the equalizer accumulation principle
- Finite sequentiality of unambiguous max-plus tree automata
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- Formal descriptions of code properties: decidability, complexity, implementation
- Transducing reversibly with finite state machines
- On the decidability of the valuedness problem for two-way finite transducers
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- Multi-sequential word relations
- On Synthesis of Resynchronizers for Transducers
- On the Decidability of the Equivalence for k-Valued Transducers
- Streamability of nested word transductions
- Sequentiality of string-to-context transducers
- Efficient algorithms for computing the inner edit distance of a regular language via transducers
- Visibly pushdown transducers
- Sequential?
This page was built for publication: Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853731)
