___ c) lists of digits such as ( 5, 4, 6, 3 ) A. regular expression C. pseudorat
ID: 3826063 • Letter: #
Question
___ c) lists of digits such as ( 5, 4, 6, 3 ) A. regular expression C. pseudorational grammar B. context free grammar D. language expression
___ d) ambn : strings with m a’s followed by n b’s , m,n 1 A. regular expression C. pseudorational grammar B. context free grammar D. language expression
___ e) a^(n)b^(n) : strings with some number of a’s followed by same number of b’s , n 1 A. regular expression C. pseudorational grammar B. context free grammar D. language expression ___
f) strings of 1’s of an even length, containing only 1’s A. regular expression C. pseudorational grammar B. context free grammar D. language expression
___ g) binary strings containing an even number of 1’s ( at least one 1 ) A. regular expression C. pseudorational grammar B. context free grammar D. language expression
Explanation / Answer
I hope you want to know the correct choice here..
c) This is Regular Expression.
Anything which is finite is Regular.
d) This is Regular Expression.
There is no memory required to compare number of a's with number of b's.
e) This is context free grammar.
Here a memory is required to keep track of number of a's and number of b's.
This can be done through stack and its context free.
f) This is Regular Expression.
We can have language with only 1 symbol and it can be Regular too.
g) This is Regular expression.
Its finite and we can write Regular Grammar for the same.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.