Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-12-19
Computer Science
Formal Languages and Automata Theory
Contributed talk titled "On the rank of the intersection of two submonoids of a free monoid" at A$^3$: Abstract Algebra and Al
Scientific paper
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.
Krishna K. V.
Singh Shubh Narayan
No associations
LandOfFree
The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-210192