A general class of monoids supporting canonisation and minimisation of (sub)sequential transducers

DOI10.1007/978-3-319-77313-1_11zbMATH Open1504.68132OpenAlexW2790028861MaRDI QIDQ1647693FDOQ1647693

Authors: Stefan Gerdjikov 

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-77313-1_11

Recommendations

• Minimizing subsequential transducers: a survey.
• Minimization algorithms for sequential transducers
• scientific article; zbMATH DE number 2089985
• scientific article; zbMATH DE number 1773097
• Generalised twinning property

zbMATH Keywords

monoidsminimisationsequential transducerscanonisation

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (4)

• Implementation and Application of Automata
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata
• Generalised twinning property
• Conditions for the existence of maximal factorizations

This page was built for publication: A general class of monoids supporting canonisation and minimisation of (sub)sequential transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647693)