A sufficient condition for the Hanna Neumann property of submonoids of a free monoid.

DOI10.1007/S00233-012-9449-4MaRDI QIDQ1955591zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 June 2013

Published in Semigroup Forum (Search for Journal in Brave)

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

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) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a special class of submonoids generated by finite prefix sets. This work continues their work and provides a sufficient condition for Hanna Neumann property for the entire class of submonoids generated by finite prefix sets. In this connection, a general rank formula for the submonoids which are accepted by semi-flower automata is also obtained.

Recommendations

• The rank and Hanna Neumann property of some submonoids of a free monoid
• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• scientific article; zbMATH DE number 1819879
• A note on intersections of free submonoids of a free monoid
• A note on the free submonoids of the monoid of prefix codes

Cites work

• scientific article; zbMATH DE number 4190013 (Why is no real title available?)
• scientific article; zbMATH DE number 3116633 (Why is no real title available?)
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• A note on intersections of free submonoids of a free monoid
• Introduction to algorithms
• On the Intersection of Finitely Generated Free Groups
• Subgroups of free groups: a contribution to the Hanna Neumann conjecture
• Submultiplicativity and the Hanna Neumann conjecture.
• The elements of statistical learning. Data mining, inference, and prediction
• The intersection of free submonoids of a free monoid is free
• The rank and Hanna Neumann property of some submonoids of a free monoid
• The topology and analysis of the Hanna Neumann conjecture.

Cited in

(2)

• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• The rank and Hanna Neumann property of some submonoids of a free monoid

This page was built for publication: A sufficient condition for the Hanna Neumann property of submonoids of a free monoid.

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