question theory of automata from Mishra CHAPTER 5

 

question theory of automata from Mishra CHAPTER 5

1. REGULAR EXPRESSIONS

2. IDENTITIES FOR REGULAR EXPRESSIONS

3. NDFAs WITH A-MOVES AND REGULAR EXPRESSIONS

4. Any set L accepted by a finite automaton M is represented by

a regular expression.

5. CONVERSION OF NONDETERMINISTIC SYSTEMS TO

DETERMINISTIC SYSTEMS

6. ALGEBRAIC METHOD USING ARDEN'S THEOREM

7. CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT

TO A REGULAR EXPRESSION.

8. EQUIVALENCE OF Two FINITE AUTOMATA

9. EQUIVALENCE OF Two REGULAR EXPRESSIONS

10. PUMPING LEMMA FOR REGULAR SETS

11. CLOSURE PROPERTIES OF REGULAR SETS

12. REGULAR SETS AND REGULAR GRAMMARS

question theory of automata from Mishra CHAPTER 6

 question theory of automata from Mishra CHAPTER 6

1. Construct a context-free grammar G generating all integers (with sign).

2. DERIVATION TREES

3. leftmost derivation and rightmost derivation.

4. AMBIGUITY IN CONTEXT-FREE GRAMMARS

5. If G is the grammar S -> SbS | a, show that G is ambiguous.

6. CONSTRUCTION OF REDUCED GRAMMARS.

7. ELIMINATION OF NULL PRODUCTIONS

8. ELIMINATION OF UNIT PRODUCTIONS

9. CHOMSKY NORMAL FORM

10. GREIBACH NORMAL FORM

question theory of automata from Mishra CHAPTER 7

 1. Model of a pushdown automaton.  ANSWER LINK + 

2. Definition -  pushdown automaton.  ANSWER LINK+ 

3. instantaneous description (ID) of pushdown automaton. + ANSWER LINK

4. move of  pushdown automaton.  ANSWER LINK

5. deterministic pda ANSWER LINK

6. Construct a pda A accepting L = {WCW^T } by final state. +  - ANSWER LINK

7. Construct a pda A accepting the set of all strings over {a, b} with equal  number of a's and b's. +
ANSWER LINK 

8. If L is a context-free language, then we can construct a pda  A accepting L by empty store, i.e. L = N(A).ANSWER LINK

question theory of automata from Mishra CHAPTER 4

 question theory of automata from Mishra CHAPTER 4 

1. DEFINITION OF A GRAMMAR

2. DERIVATIONS AND THE LANGUAGE GENERATED

BY A GRAMMAR

3. CHOMSKY CLASSIFICATION OF LANGUAGES

4. RECURSIVE AND RECURSIVELY ENUMERABLE SETS

THEORY OF COMPUTATION QUESTION SET:

 CHAPTER 3 : THE THEORY OF AUTOMATA  LINK

 CHAPTER 4 :   FORMAL LANGUAGES LINK

 CHAPTER 5 :  REGULAR SETS AND  REGULAR GRAMMARS LINK

 CHAPTER 6 : CFG LINK

 CHAPTER 7 :  PUSH DOWN AUTOMATA LINK

 CHAPTER 9 : TURING MACHINE  LINK

29. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order.

 29. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order.

BUBBLE SORT TECHNIQUE:

C++ CODE: 

28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void.

 28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void.

27. Copy the contents of one text file to another file, after removing all whitespaces.

 27. Copy the contents of one text file to another file, after removing all whitespaces.

26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks

 26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks

25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file.

 25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file.