The minimal deterministic finite automaton recognizing the strong semilattice of finite monoids

DOI10.3969/J.ISSN.2095-4298.2017.04.010MaRDI QIDQ4574994zbMATH OpenFDO

Authors Hongwei Li

Publication date 18 July 2018

Full work available at URL https://doi.org/10.3969/J.ISSN.2095-4298.2017.04.010

zbMATH Keywords

deterministic finite automatonmonoidstrong semilattice

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• On deterministic finite automata and syntactic monoid size
• scientific article; zbMATH DE number 1948503
• Congruence and minimization of deterministic weighted finite automata
• Automata with Extremal Minimality Conditions
• scientific article; zbMATH DE number 4108164

Cited in

(4)

• scientific article; zbMATH DE number 999598 (Why is no real title available?)
• scientific article; zbMATH DE number 1948503 (Why is no real title available?)
• scientific article; zbMATH DE number 2040919 (Why is no real title available?)
• On deterministic finite automata and syntactic monoid size

This page was built for publication: The minimal deterministic finite automaton recognizing the strong semilattice of finite monoids

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