Scribd
Upload
20 views

HW 3

The document outlines 5 questions for a homework assignment on automata theory and formal languages. The questions cover topics like recognizable vs decidable languages, Turing machines, and the relationships between different language classes.

Uploaded by

Telat Abi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

HW 3

The document outlines 5 questions for a homework assignment on automata theory and formal languages. The questions cover topics like recognizable vs decidable languages, Turing machines, and the relationships between different language classes.

Uploaded by

Telat Abi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS476: Automata Theory and Formal Languages

Homework 3
Assigned: 23/12/2013
Due: 31/12/2013, 17:00

Questions

1. (20pts) State whether the following statements are true or not. You must give a BRIEF explanation
or show a counter example to receive full credit.

(a) If a language L is recognizable then the language L̄ is decidable.


(b) If languages L1 and L1 ∪ L2 are decidable then L2 must also be decidable.
(c) If a language L is not in P then it must be undecidable.
(d) Given a language L in NP-c, there exist a polynomial-time reduction from L to Boolean
Satisfiability Problem (SAT).

2. (20pts) Give a Turing Machine that decides language L = {w ∈ {0, 1}∗ : n0 (w) 6= 2n1 (w)}.

3. (20pts) A multiple-head Turing machine has m heads reading cells of one tape. A move of this TM
depends on the state and on the symbol scanned by each head. In one move, the TM can change
state, write a new symbol on the cell scanned by each head, and can move each head left, right,
or keep it stationary. Since several heads may be scanning the same cell, we assume the heads are
numbered 1 through m, and the symbol written by the highest numbered head scanning a given
cell is the one that actually gets written there. Show that this variant of TM model is equivalent
to ordinary TM model.

4. (20pts) Disprove (by reduction) or prove that the following languages are decidable.

(a) L = {hAi : A is a DFA and L(A) is infinite}


(b) L = {hM, M 0 , ki : M and M 0 are TMs and |L(M ) ∪ L(M 0 )| ≥ k}

5. (20pts) Given two languages LA and LB , language LC is defined as follows:

LC = {w : w ∈ LA and wR ∈ LB }

(a) Let A and B be deciders for languages LA and LB , respectively. Construct a decider C for
language LC .
(b) Let language LB be decidable. Prove that LA is decidable if LC is decidable.

You might also like