1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines...
-
date post
21-Dec-2015 -
Category
Documents
-
view
224 -
download
1
Transcript of 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines...
![Page 1: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/1.jpg)
1
Linear Bounded AutomataLBAs
![Page 2: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/2.jpg)
2
Linear Bounded Automata (LBAs)are the same as Turing Machineswith one difference:
The input string tape spaceis the only tape space allowed to use
![Page 3: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/3.jpg)
3
[ ]a b c d e
Left-endmarker
Input string
Right-endmarker
Working space in tape
All computation is done between end markers
Linear Bounded Automaton (LBA)
![Page 4: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/4.jpg)
4
We define LBA’s as NonDeterministic
Open Problem:
NonDeterministic LBA’shave same power withDeterministic LBA’s ?
![Page 5: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/5.jpg)
5
Example languages accepted by LBAs:
}{ nnn cbaL
}{ !naL
LBA’s have more power than NPDA’s
LBA’s have also less power than Turing Machines
![Page 6: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/6.jpg)
6
The Chomsky Hierarchy
![Page 7: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/7.jpg)
7
Unrestricted Grammars:
Productionsvu
String of variablesand terminals
String of variablesand terminals
![Page 8: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/8.jpg)
8
Example unrestricted grammar:
dAc
cAaB
aBcS
![Page 9: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/9.jpg)
9
A language is recursively enumerableif and only if is generated by anunrestricted grammar
LL
Theorem:
![Page 10: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/10.jpg)
10
Context-Sensitive Grammars:
and: |||| vu
Productionsvu
String of variablesand terminals
String of variablesand terminals
![Page 11: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/11.jpg)
11
The language }{ nnn cba
is context-sensitive:
aaAaaaB
BbbB
BbccAc
bAAb
aAbcabcS
|
|
![Page 12: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/12.jpg)
12
A language is context sensistive if and only if is accepted by a Linear-Bounded automatonL
LTheorem:
There is a language which is context-sensitivebut not recursive
Observation:
![Page 13: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/13.jpg)
13
Non-recursively enumerable
Recursively-enumerable
Recursive
Context-sensitive
Context-free
Regular
The Chomsky Hierarchy
![Page 14: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/14.jpg)
14
Decidability
![Page 15: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/15.jpg)
15
Consider problems with answer YES or NO
Examples:
• Does Machine have three states ?M
• Is string a binary number? w
• Does DFA accept any input? M
![Page 16: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/16.jpg)
16
A problem is decidable if some Turing machinedecides (solves) the problem
Decidable problems:
• Does Machine have three states ?M
• Is string a binary number? w
• Does DFA accept any input? M
![Page 17: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/17.jpg)
17
Turing MachineInputprobleminstance
YES
NO
The Turing machine that decides (solves) a problem answers YES or NO for each instance of the problem
![Page 18: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/18.jpg)
18
The machine that decides (solves) a problem:
• If the answer is YES then halts in a yes state
• If the answer is NO then halts in a no state
These states may not be final states
![Page 19: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/19.jpg)
19
YES states
NO states
Turing Machine that decides a problem
YES and NO states are halting states
![Page 20: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/20.jpg)
20
Difference between
Recursive Languages and Decidable problems
The YES states may not be final states
For decidable problems:
![Page 21: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/21.jpg)
21
Some problems are undecidable:
which means:there is no Turing Machine thatsolves all instances of the problem
A simple undecidable problem:
The membership problem
![Page 22: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/22.jpg)
22
The Membership Problem
Input: •Turing MachineM
•String w
Question: Does accept ? M w
?)(MLw
![Page 23: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/23.jpg)
23
Theorem:
The membership problem is undecidable
Proof: Assume for contradiction thatthe membership problem is decidable
(there are and for which we cannotdecide whether )
M w)(MLw
![Page 24: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/24.jpg)
24
Thus, there exists a Turing Machinethat solves the membership problem
H
HM
w
YES M accepts w
NO M rejects w
![Page 25: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/25.jpg)
25
Let be a recursively enumerable language L
Let be the Turing Machine that acceptsM L
We will prove that is also recursive: L
we will describe a Turing machine thataccepts and halts on any inputL
![Page 26: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/26.jpg)
26
M accepts ?wNO
YESM
w
Hacceptw
Turing Machine that acceptsand halts on any input
L
reject w
![Page 27: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/27.jpg)
27
Therefore, L is recursive
But there are recursively enumerablelanguages which are not recursive
Contradiction!!!!
Since is chosen arbitrarily, every recursively enumerable language is also recursive
L
![Page 28: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/28.jpg)
28
Therefore, the membership problem is undecidable
END OF PROOF
![Page 29: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/29.jpg)
29
Another famous undecidable problem:
The halting problem
![Page 30: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/30.jpg)
30
The Halting Problem
Input: •Turing MachineM
•String w
Question: Does halt on input ? M w
![Page 31: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/31.jpg)
31
Theorem:
The halting problem is undecidable
Proof: Assume for contradiction thatthe halting problem is decidable
(there are and for which we cannotdecide whether halts on input )
M wM w
![Page 32: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/32.jpg)
32
Thus, there exists Turing Machinethat solves the halting problem
H
HM
w
YES M halts on w
Mdoesn’t halt on
wNO
![Page 33: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/33.jpg)
33
H
wwM 0q
yq
nq
Input:initial tape contents
Encodingof M w
String
YES
NO
Construction of H
![Page 34: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/34.jpg)
34
Construct machine :H
If returns YES then loop forever H
If returns NO then haltH
![Page 35: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/35.jpg)
35
H
wwM 0q
yq
nq NO
aq bq
H
Loop forever
YES
![Page 36: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/36.jpg)
36
HConstruct machine :
Input:
If M halts on input Mw
Then loop forever
Else halt
Mw (machine )M
![Page 37: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/37.jpg)
37
MwMM wwcopy
MwH
H
![Page 38: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/38.jpg)
38
HRun machine with input itself:
Input:
If halts on input
Then loop forever
Else halt
Hw ˆ (machine )H
H Hw ˆ
![Page 39: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/39.jpg)
39
on input H Hw ˆ
If halts then loops forever
If doesn’t halt then it halts
:
H
H
NONSENSE !!!!!
![Page 40: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/40.jpg)
40
Therefore, we have contradiction
The halting problem is undecidable
END OF PROOF
![Page 41: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/41.jpg)
41
Another proof of the same theorem:
If the halting problem was decidable thenevery recursively enumerable languagewould be recursive
![Page 42: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/42.jpg)
42
Theorem:
The halting problem is undecidable
Proof: Assume for contradiction thatthe halting problem is decidable
![Page 43: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/43.jpg)
43
There exists Turing Machinethat solves the halting problem
H
HM
w
YES M halts on w
Mdoesn’t halt on
wNO
![Page 44: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/44.jpg)
44
Let be a recursively enumerable language L
Let be the Turing Machine that acceptsM L
We will prove that is also recursive: L
we will describe a Turing machine thataccepts and halts on any inputL
![Page 45: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/45.jpg)
45
M halts on ?wYES
NOM
w
Run with input
Mw
Hreject w
acceptw
rejectw
Turing Machine that acceptsand halts on any input
L
Halts on final state
Halts on non-final state
![Page 46: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/46.jpg)
46
Therefore L is recursive
But there are recursively enumerablelanguages which are not recursive
Contradiction!!!!
Since is chosen arbitrarily, every recursively enumerable language is also recursive
L
![Page 47: 1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.](https://reader036.fdocuments.net/reader036/viewer/2022062421/56649d575503460f94a36466/html5/thumbnails/47.jpg)
47
Therefore, the halting problem is undecidable
END OF PROOF