Scribd
Upload
28 views4 pages

True or False: Homework #9

This document discusses properties of regular languages, context-free languages, and recursive languages. It proves several properties, including: 1. There is no algorithm to determine if an arbitrary Turing machine halts on a given input string, by reducing the halting problem to this question. 2. Recursive languages are closed under union, intersection, complementation, concatenation, and Kleene star operations, while recursively enumerable languages are closed under union, intersection, concatenation but not complementation.

Uploaded by

Manoj Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
28 views4 pages

True or False: Homework #9

This document discusses properties of regular languages, context-free languages, and recursive languages. It proves several properties, including: 1. There is no algorithm to determine if an arbitrary Turing machine halts on a given input string, by reducing the halting problem to this question. 2. Recursive languages are closed under union, intersection, complementation, concatenation, and Kleene star operations, while recursively enumerable languages are closed under union, intersection, concatenation but not complementation.

Uploaded by

Manoj Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Homework #9 1. True or False a. b. c. d.

Recursive languages are closed under complement TRUE Every language can be recognized by a Turing machine TRUE The membership question or recursive languages is decidable TRUE The membership question or conte!t" ree languages is decidable TRUE FALSE FALSE FALSE FALSE

#$ List % decidable problems about regular languages& % about conte!t" ree languages and % about recursive languages. 'ot do(n ho( they might be decided. #%. )rove that there is no algorithm that determines (hether an arbitrary Turing machine halts (hen run (ith the input string $*$. )roo by contradiction Assume such a Turing +achine does e!ist. ,all it A-

,reate a Turing +achine . (hich produces the encoding o a Turing +achine +/. +/ has all o +/s transitions& but some additional transitions to erase any input so that +/ runs + on an empty tape.ote that + halts on a blan0 tape e!actly (hen +/ halts on $*$. This (ill decide the blan0 tape problem (hich is undecidable.

,an also reduce the 1alting )roblemAgain assume& machine A e!ists-

To reduce 1) to this& consider a T+ . that converts R2+3 ( to R2+/3$*$ (here +/ has all o +/s transitions e!cept that there are e!tra transitions to replace $*$ (ith (& return the tape head to the beginning and to the start state o +& 2and then runs +3

#4. List % undecidable problems about regular languages& % about conte!t" ree languages and % about r.e. languages. )rovide a re erence to the 5usti ication. 6 #7. )rove- L and L are recursively enumerable 2re3 i and only i L is recursive. 6 First- i L is recursive& L is recursive 25ust s(itch inal and non" inal states on L/s machine to get a machine or L. 3 6 a3 8 L is recursive& then L and L are re)roo 8 L is recursive& a T+& + that accepts it& so L is re 9y the above& i L is recursive& its complement is recursive and hence re 6 b3 8 L and L are re& then their machines can be put together to orm $ machine that both accepts and re5ects. Thus L is recursive.

#:. Sho( that recursive languages are closed under union& intersection& complementation& concatenation& and ;. ,an be sho(n by <putting together= Total T+/s-

,an be sho(n by <putting together= T+/s-

,omplement-

Rest are similar #>. Sho( that re languages are closed under union& intersection& concatenation and ;.

Similar to #5 except there are no No arrows. #?. Sho( that re languages are not closed under complementation 2hint- see #:3 6 8 re languages (ere closed under complement& then both L and L (ould be re and hence recursive& ma0ing all re languages recursive (hich (e 0no( is not true.

You might also like