Abstract
This paper describes a characterization of context-free languages by means of expressions using union, substitution, and an iterative substitution called substitution star. The “substitution expressions” so defined have some properties analogous to those of regular expressions. The well-known cases of linear and regular subfamilies of context-free languages are obtainable from the general model by placing proper restrictions on the basis over which the substitution expressions are defined. The notion of substitution star height of a substitution expression is defined analogously to regular star height for regular expressions. It shown that for each n≥0 there exists a context-free, in fact, linear language whose substitution star height is n.
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.
