Assignment 7: Properties of CFL + Turing Machines

CS 203: Formal Languages and Automaton Theory

April 16, 2017

Q.1) Which of the following are decidable?

a) Whether the intersection of two regular languages is infinite
b) Whether a given context-free language is regular
c) Whether two push-down automata accept the same language
d) Whether a given grammar is context-free

Q.2) Is that language Closed under the following operations?

Regular DCFL CFL CSL Rec RE
Union L1 L2
Intersection L1 L2
Complement L0
Concatenation L1 .L2
Kleene Closure L
Reverse LR no info. no info. no info.
Homomorphism h(L) no info. no info. no info.
Inverse Homomorphism h1 (L) no info. no info. no info.

Q.3) Is that language decidable for the following:

Regular CFL CSL Recursive(Rec) Recursively Enumerable(RE)
Membership
Emptiness
Finiteness
Equivalence

Q.4) Deterministic Context Free Language is decidable for ???? and ????.

Q.5) Write Turing machine which could accept:

a) an bn |n 1
b) an bn cn |n 1

Q.6) Design a Turing machine that works as a transducer for finding:

a) 1s Complement of any number in binary
b) 2s Complement of any number in binary
c) sum of two numbers in unary
d) comparing two numbers in binary

Q.7) Let L = {0n 1n | n 0} be a context free language. Which of the following is correct?
(A) L0 is context free and Lk is not context free for any k 1
(B) L0 is not context free and Lk is context free for any k 1
(C) Both L0 and Lk is for any k 1 are context free.
(D) Both L0 and Lk is for any k 1 are not context free.

Q.8) Let L(R) be the language represented by regular expression R. Let L(G) be the language gen-
erated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M. Which
of the following decision problems are undecidable?
a) Given a regular expression R and a string w, is w L(R)?
b) Given a context-free grammar G, is L(G) = ?
c) Given a context-free grammar G, is L(G) = for some alphabet ?
d) Given a Turing machine M and a string w, is w L(M )?

Q.9) Identify language class for each of the following languages:

1
2
3
4