Abstract
In this paper a partial characterization for a subclass of ETOL languages is obtained. The main result binds together the number of occurrences (in words of a given ETOL language) of letters, from a given set, with their distribution. It provides a very helpful tool to prove that certain languages are not ETOL.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.