Answer to Question #38160 in Math for Sujata Roy

Question #38160

The language L = {0^i 21^i | i <= 0} over the alphabet {0,1,2} is
(A) not recursive
(B) is recursive and is a deterministic CFL
(C) us a regular language
(D) is not a deterministic CFI but a CFL

Expert's answer

Download Answer

Learn more about our help with Assignments: Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. If the entire program is written in FORTRAN, the percentage increase in the execution time, compared
2. To completely write the program in FORTRAN and rewrite the 1% code in assembly language, if the proj
3. If the strings of a language L can be effectively enumerated in lexicographic (i.e. alphabetic) orde
4. Nobody knows yet if P = NP. Consider the language L defined as follows L=(0 + 1)* if P=NP L= φ
5. A channel connecting source and destination has data rate of 1 Mbps and one way propagation delay of
6. Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of sta
7. the logic of pumping lemma is a good example of a)the pigeonhole principle b)the divide and conquer

Who Can Help Me with My Assignment

There are three certainties in this world: Death, Taxes and Homework Assignments. No matter where you study, and no matter…
How to Finish Assignments When You Can’t

Crunch time is coming, deadlines need to be met, essays need to be submitted, and tests should be studied for.…
How to Effectively Study for a Math Test

Numbers and figures are an essential part of our world, necessary for almost everything we do every day. As important…