Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
5Activity
0 of .
Results for:
No results containing your search query
P. 1
Chapter 07. Hierarchy of Models

Chapter 07. Hierarchy of Models

Ratings: (0)|Views: 55 |Likes:
Published by kims3515354178

More info:

Published by: kims3515354178 on Dec 05, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

09/28/2010

pdf

text

original

 
1
Hierarchy of the Models
 
2
7. Hierarchy of the Models: Characterization
We have studied four classes of formal languages and their grammars, four classes of automata and their variations, and other models for representing or generating languages such as regular expressions, syntax flow graphs and L-systems. In this chapter wewill study the relations, called the Chomsky hierarchy, between these models. The Chomsky hierarchy reveals two importantrelationships, characterizations and containments, among the four classes of languages and automata.The characterizations show the relations between the models for the language generation (i.e., grammars) and those for languagerecognition (i.e., automata) or expression. For example, a language L can be generated by a regular grammar if and only if it isrecognizable by an FA, and a language L is recognizable by an FA if and only if it is expressible by a regular expression.The containments show the set relations among the classes of languages generated (recognized) by the four types of grammars(respectively, automata). For example, the class of languages generated (recognized) by context-free grammars (respectively, byPDA) properly contains the class of languages generated (recognized) by regular grammars (respectively, FA). The same setrelation holds among the classes of languages generated (recognized) by type 0, 1, and 2 grammars (respectively, TM, LBA, andPDA).In terms of computational capability, this containment relation between the four classes of languages recognized by TM, LBA,PDA, and FA implies that anything computable by an LBA is also computable by TM, but not necessarily the other way around,and anything computable by a PDA is also computable by LBA, and so on. Therefore the Chomsky hierarchy provides valuableinformation for designing an efficient computational model, as well as for analyzing the computational capability of a givenmodel. This chapter proves the characterization of the models at the lowest level of the hierarchy, i.e., regular grammars, FA, andregular expressions. Laying the groundwork through the following chapters, we will complete the proof of the hierarchy inChapters 12 and 15.
 
3
Hierarchy
7.1 Chomsky Hierarchy 1877.2 Proof of Characterization 191
Constructing an FA from a regular grammar G that recognizes L(G).Constructing a regular grammar from an FA M that produces L(M).Constructing an FA from a regular expression R that recognizes L(R).Constructing a regular expression from an FA M that expresses L(M). 
Rumination 215Exercises 216Today’s Quote
You’re alive. Do something. The directive in life, the moral imperative was so uncomplicated. It could be expressedin single words, not complete sentences. It sounded like this: Look. Choose. Act.- Barbara Hall -Break Time

Activity (5)

You've already reviewed this. Edit your review.
1 hundred reads
xuke liked this
vinaYNANI77 liked this
Kinan Khan liked this
arnknr liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->