Abstract
This chapter discusses the formal language theory. The methods for specifying the families of formal languages relate a number of diverse activities. The chapter discusses the different ways to describe the families of languages that are of interest to computer scientists. The formal languages arose from the study of natural languages. However, it was the work of the linguist Noam Chomsky in 1956 that is regarded as the starting point. In the paper, Chomsky presented the concept of a general phrase structure grammar. Therefore, one way to define a family of languages is by generative mechanisms, that is, by grammar. A family of languages that is not closed under intersection with regular sets should not be studied for its own right but only for other purposes. Thus, the Intersection theorem is an indication towards determining appropriate families of languages to study. Instead of concern to a scattering of linguists, logicians, and mathematicians, formal languages has become an object of study to the large group of individuals interested in the rapidly developing field of computers.
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 callMore From: Formal Language Theory: Perspectives and Open Problems
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.
