Abstract
A generalization of ranked alphabets, many-sorted alphabets, is studied. The concepts of finite automaton, regular, recognizable, equational, and context free languages are generalized to sets over these new alphabets. It is shown that the derivation trees of a context free set are always characterized by some recognizable set over a related many-sorted alphabet. Previous theory is drawn as a special case of these results and new results are advanced. A number of suggestions about language theory are made.
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.
