Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-12-19
Computer Science
Formal Languages and Automata Theory
Scientific paper
Giambruno and Restivo have obtained Hanna Neumann property (HNP) of two submonoids of a free monoid which are accepted by deterministic semi-flower automata each with a unique bpi and their product automaton is semi-flower with a unique bpi. Further, if the product automaton has more than one bpi, Giambruno and Restivo have provided examples of submonoids of a free monoid which fail to satisfy HNP. Recently, Singh and Krishna extended the work of Giambruno and Restivo and obtained a condition on the product automaton with two bpi's in order to satisfy HNP. In a general case, if the product automaton has arbitrary number of bpi's, the present work provides a sufficient condition for HNP of the respective submonoids. In this connection, the rank of the submonoid of a free monoid that is accepted by a semi-flower automaton is also obtained.
Krishna K. V.
Singh Shubh Narayan
No associations
LandOfFree
A Sufficient Condition for Hanna Neumann Property of 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 A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-210233