Abstract
A language L is called characteristic for a given abstract family of automata if the least AFL containing L can be defined by placing restrictions on the given machine representation. Necessary and sufficient conditions are given for a language to be characteristic. It is shown that there are subAFLs of the family of context-free languages not definable by any restrictions on pushdown store automata.
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.
