The rank and Hanna Neumann property of some submonoids of a free monoid

zbMATH Open1274.68213arXiv1112.4250MaRDI QIDQ4913402FDOQ4913402

Authors:

Publication date: 5 April 2013

Abstract: This work aims at further investigations on the work of Giambruno and Restivo to find the rank of the intersection of two finitely generated submonoids of a free monoid. In this connection, we obtain the rank of a finitely generated submonoid of a free monoid that is accepted by semi-flower automaton with two bpi's. Further, when the product automaton of two deterministic semi-flower automata with a unique bpi is semi-flower with two bpi's, we obtain a sufficient condition on the product automaton in order to satisfy the Hanna Neumann property.

Full work available at URL: https://arxiv.org/abs/1112.4250

Recommendations

• A sufficient condition for the Hanna Neumann property of submonoids of a free monoid.
• On Howson's theorem
• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• On the rank of the subsets of a free monoid
• scientific article; zbMATH DE number 4190013

zbMATH Keywords

rankfinitely generated monoidssemi-flower automataHanna Neumann property

Mathematics Subject Classification ID

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

Cited In (3)

• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• A sufficient condition for the Hanna Neumann property of submonoids of a free monoid.
• On the rank of the subsets of a free monoid

This page was built for publication: The rank and Hanna Neumann property of some submonoids of a free monoid

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