Over Which Monoids is the Transducer Determinization Procedure Applicable?
From MaRDI portal
Recommendations
- Finite transducers for divisibility monoids
- scientific article; zbMATH DE number 1419259
- scientific article; zbMATH DE number 223548
- scientific article; zbMATH DE number 4009840
- Transformation monoids with finite monoidal intervals
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages
- Monoid-labeled transition systems
- Complexity Analysis: Transformation Monoids of Finite Automata
- Some contributions to the theory of transformation monoids
Cites work
- A generalised twinning property for minimisation of cost register automata
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Sequential?
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
Cited in
(5)- Generalised twinning property
- Determinization of transducers over finite and infinite words.
- Determinization of transducers over infinite words: The general case
- Space-efficient bimachine construction based on the equalizer accumulation principle
- scientific article; zbMATH DE number 1670852 (Why is no real title available?)
This page was built for publication: Over Which Monoids is the Transducer Determinization Procedure Applicable?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739012)