Abstract
We consider learning of graph languages (sets of graphs) which are generated by restricted regular node label controlled (for short RNLC) graph grammars. We show that for any restricted RNLC graph languages L, given the Parikh image of L, one can construct a restricted RNLC graph grammar G such that L(G)=L in polynomial time. We present an algorithm to construct a restricted RNLC graph grammar which generates an unknown restricted RNLC graph language using restricted superset queries and restricted subset queries. We also showed that for a fixed nonnegative integer t, this algorithm halts in polynomial time when the Parikh image of the unknown restricted RNLC graph languages has at most t-periods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
