World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Constructing Automaton with the Closure of Language Calculation

    https://doi.org/10.1142/9789812772763_0036Cited by:0 (Source: Crossref)
    Abstract:

    It is difficult to construct automaton that receives sophisticate language, but we can transit simple languages to complicate languages through calculating between them. Based on the characteristic of right-line language, context free language and context sense language, this text bring up the method of constructing simple automaton to complex automaton. It is easy and utility. It is also can be used of the academic bases for proving the closing in language with FA.