02-15-2011, 02:45 AM
My todays paper of CS402
1)How the language EVEN EVEN of strings can be written with even number of a's and even number of b's defined over sigma={a,b}?
2)Define the language of of strings containing aa or bb defined over sigma={a,b}?
3)For every mealy machine there is a moore machine that is equivalent to ?
4)Define Mealy machine?
5)What are regular and non regular languages?
6)what is ment by decidable problem?
7)differentiate b/w CFG and CNF?
8)What is non deterministic PDA?
9)what is POP and PUSH?
10)what is conversion form of PDA?
1)How the language EVEN EVEN of strings can be written with even number of a's and even number of b's defined over sigma={a,b}?
2)Define the language of of strings containing aa or bb defined over sigma={a,b}?
3)For every mealy machine there is a moore machine that is equivalent to ?
4)Define Mealy machine?
5)What are regular and non regular languages?
6)what is ment by decidable problem?
7)differentiate b/w CFG and CNF?
8)What is non deterministic PDA?
9)what is POP and PUSH?
10)what is conversion form of PDA?