Abstract
A new automaton, called a contraction automaton of complexity (n, k), n > 0, k > 1, is defined, and several well-known classes of formal languages, which had up to date only been characterized by grammars, are characterized by this new automaton.
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.