cdt314 faber formal languages, automata and models of computation lecture 12
DESCRIPTION
CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2012. Content Chomsky’s Language Hierarchy Turing Machines Determinism Halting TM Examples Standard TM Computing Functions with TM Combining TMs Turing Thesis. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/1.jpg)
1
CDT314
FABER
Formal Languages, Automata and Models of Computation
Lecture 12
Mälardalen University
2012
![Page 2: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/2.jpg)
2
Content
Chomsky’s Language Hierarchy Turing Machines DeterminismHaltingTM ExamplesStandard TMComputing Functions with TMCombining TMsTuring Thesis
![Page 3: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/3.jpg)
3
Regular Languages
**ba
Context-free languagesPush-down Automata
Recursively enumerable languagesTuring Machines
}0:{ ncba nnn
}0:{ nba nn
}},{:{ bawww
}*},{:{ bawwwR
}0:{ ! nan }0:{2
nba nn
Finite Automata
ba *
![Page 4: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/4.jpg)
4
http://www.turing.org.uk/turing/
Who was Alan Turing?
Founder of Computability Theory,
mathematician,
philosopher,
codebreaker,
visionary man before his time.
http://www.cs.usfca.edu/www.AlanTuring.net/turing_archive/index.html- Jack
Copeland and Diane Proudfoot http://www.turing.org.uk/turing/ The Alan Turing Home Page
Andrew Hodges
![Page 5: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/5.jpg)
5
Alan Turing
1912 (23 June): Birth, London
1926-31: Sherborne School
1930: Death of friend Christopher Morcom
1931-34: Undergraduate at King's College, Cambridge University
1932-35: Quantum mechanics, probability, logic
1935: Elected fellow of King's College, Cambridge
1936: The Turing machine, computability, universal machine
1936-38: Princeton University. Ph.D. Logic, algebra, number theory
1938-39: Return to Cambridge. Introduced to German Enigma cipher machine
1939-40: The Bombe, machine for Enigma decryption
1939-42: Breaking of U-boat Enigma, saving battle of the Atlantic
![Page 6: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/6.jpg)
6
Alan Turing
1943-45: Chief Anglo-American crypto consultant. Electronic work.
1945: National Physical Laboratory, London
1946: Computer and software design leading the world.
1947-48: Programming, neural nets, and artificial intelligence
1948: Manchester University
1949: First serious mathematical use of a computer
1950: The Turing Test for machine intelligence
1951: Elected FRS. Non-linear theory of biological growth
1952: Arrested as a homosexual, loss of security clearance
1953-54: Unfinished work in biology and physics
1954 (7 June): Death (suicide) by cyanide poisoning, Wilmslow, Cheshire.
![Page 7: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/7.jpg)
7
Hilbert’s Program, 1900
Hilbert’s hope was that mathematics would be reducible to finding proofs (manipulating the strings of symbols) from a fixed system of axioms, axioms that everyone could agree were true.
Can all of mathematics be made algorithmic, or will there always be new problems that outstrip any given algorithm, and so require creative acts of mind to solve?
![Page 8: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/8.jpg)
8
Turing Machines and Computability
The question Hilbert raised was whether there could be a general method or process by which one could decide whether a mathematical proposition could be proved. But what exactly was meant by a 'method' or 'process'? People had already used the concept of a 'mechanical' process, and Turing had an idea which made this quite precise: computability. Turing wrote in his first sentences:
“The "computable" numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by finite means... a number is computable if its decimal can be written down by a machine. “
http://www.turing.org.uk/turing/scrapbook/machine.html
![Page 9: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/9.jpg)
9
Turing Machines and Computability
The Turing machine concept involves specifying a very restricted set of logical operations, but Turing showed how other more complex mathematical procedures could be built out of these atomic components.
Turing argued that his formalism was sufficiently general to encompass anything that a human being could do when carrying out a definite method.
Turing's famous 1936-7 paper On computable numbers, with an application to the Entscheidungsproblem, which worked out the theory of Turing machines and the definition of computability, is available as a PDF file on-line:
http://www.cs.ox.ac.uk/activities/ieg/e-library/sources/tp2-ie.pdf
![Page 10: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/10.jpg)
10
Turing Machines
Based on C Busch, RPI, Models of Computation
![Page 11: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/11.jpg)
Turing Machines
Turing’s "Machines". These machines are humans who calculate. (Wittgenstein)
A man provided with paper, pencil, and rubber, and subject to strict discipline, is in effect a universal machine. (Turing)
11
![Page 12: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/12.jpg)
12
............Tape
Read-Write head
Control Unit
Turing Machine
![Page 13: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/13.jpg)
13
............
Read-Write head
No boundaries -- infinite length
The head moves Left or Right
The Tape
![Page 14: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/14.jpg)
14
............
Read-Write head
1. Reads a symbol
2. Writes a symbol
3. Moves Left or Right
The head at each time step:
![Page 15: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/15.jpg)
15
ExampleTime 0
............ a a cb
Time 1............ a b k c
1. Reads a2. Writes k3. Moves Left
![Page 16: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/16.jpg)
16
Time 1............ a b k c
Time 2............ a k cf
1. Reads b2. Writes f
3. Moves Right
![Page 17: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/17.jpg)
17
Head starts at the leftmost position
of the input string
............
Blank symbol
head
a b ca
Input string
The Input String
#####
![Page 18: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/18.jpg)
18
1q 2qLba ,
Read WriteMove Left
1q 2qRba ,
Move Right
States & Transitions
![Page 19: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/19.jpg)
19
Example
1q 2qRba ,
............ a b ca
Time 1
1qcurrent state
#####
![Page 20: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/20.jpg)
20
............ # a b caTime 1
1q 2qRba ,
............ a b cbTime 2
1q
2q
# # # #
# # # # #
![Page 21: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/21.jpg)
21
............ a b caTime 1
1q 2qLba ,
............ a b cbTime 2
1q
2q
Example
# # # # #
# # # # #
![Page 22: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/22.jpg)
22
............ a b caTime 1
1q 2qRg,#
............ ga b cbTime 2
1q
2q
Example
# # # # #
# # # #
![Page 23: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/23.jpg)
23
Determinism
1q
2qRba ,
Allowed Not Allowed
3qLdb ,
1q
2qRba ,
3qLda ,
No lambda transitions allowed in TM!
Turing Machines are deterministic
![Page 24: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/24.jpg)
24
Determinism
Note the difference between state indeterminismwhen not even possible future states are known in advance
and choice indeterminismwhen possible future states are known,but we do not know which state will be taken.
![Page 25: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/25.jpg)
25
Partial Transition Function
1q
2qRba ,
3qLdb ,
............ a b ca
1q
Example
No transition
for input symbol c
Allowed
# # # # #
![Page 26: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/26.jpg)
26
Halting
The machine halts if there are
no possible transitions to follow
![Page 27: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/27.jpg)
27
Example
............ a b ca
1q
1q
2qRba ,
3qLdb ,
No possible transition
HALT!
# # # # #
![Page 28: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/28.jpg)
28
Final States
1q 2q Allowed
1q 2q Not Allowed
• Final states have no outgoing transitions
• In a final state the machine halts
![Page 29: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/29.jpg)
29
Acceptance
Accept InputIf machine halts
in a final state
Reject Input
If machine halts
in a non-final state
or
If machine enters
an infinite loop
![Page 30: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/30.jpg)
30
Turing Machine Example
A TM that accepts the language *aa
0q
Raa ,
L,##1q
![Page 31: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/31.jpg)
31
Time 0 aa
0q
a
0q
Raa ,
1qL,##
# # # #
![Page 32: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/32.jpg)
32
Time 1 aa
0q
a
0q
Raa ,
1q
# # # #
L,##
![Page 33: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/33.jpg)
33
Time 2 aa
0q
a
0q
Raa ,
1q
# # # #
L,##
![Page 34: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/34.jpg)
34
Time 3aa
0q
a
0q
Raa ,
1qL,##
# # # #
![Page 35: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/35.jpg)
35
Time 4 aa
1q
a
0q
Raa ,
1q
Halt & Accept
L,##
# # # #
![Page 36: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/36.jpg)
36
Rejection Example
Time 0 ba
0q
a
0q
Raa ,
1qL,##
# # # #
![Page 37: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/37.jpg)
37
0q
Raa ,
1q
Time 1 ba
0q
a
No possible Transition
Halt & Reject
L,##
# # # #
![Page 38: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/38.jpg)
38
Infinite Loop Example
0q
Raa ,
1q
Lbb ,
Another TM for language *aa
L,##
![Page 39: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/39.jpg)
39
Time 0 ba
0q
a
0q
Raa ,
1q
Lbb ,
L,##
# # # #
![Page 40: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/40.jpg)
40
Time 1 ba
0q
a
0q
Raa ,
1q
Lbb ,
L,##
# # # #
![Page 41: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/41.jpg)
41
Time 2 ba
0q
a
0q
Raa ,
1q
Lbb ,
L,##
# # # #
![Page 42: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/42.jpg)
42
Time 2 ba
0q
a
baTime 3
0q
a
baTime 4
0q
a
baTime 5
0q
a
... infinite loop…
# # # #
# # # #
# # # #
# # # #
![Page 43: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/43.jpg)
43
Because of the infinite loop:
•The final state cannot be reached
•The machine never halts
•The input is not accepted
![Page 44: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/44.jpg)
44
Another Turing Machine Example
Turing machine for the language }{ nnba
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
![Page 45: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/45.jpg)
45
Time 0 ba
0q
a b
Ryy ,
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
4q
L,##
# # #}{ nnba
![Page 46: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/46.jpg)
46
bx
1q
a bTime 1
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 47: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/47.jpg)
47
bx
1q
a bTime 2
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 48: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/48.jpg)
48
yx
2q
a bTime 3
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 49: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/49.jpg)
49
yx
2q
a bTime 4
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 50: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/50.jpg)
50
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
yx
0q
a bTime 5
L,##
# # #}{ nnba
![Page 51: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/51.jpg)
51
yx
1q
x bTime 6
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 52: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/52.jpg)
52
yx
1q
x bTime 7
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 53: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/53.jpg)
53
yx x y
2q
Time 8
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 54: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/54.jpg)
54
yx x y
2q
Time 9
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 55: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/55.jpg)
55
Ryy ,
yx
0q
x yTime 10
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
4q
L,##
# # #}{ nnba
![Page 56: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/56.jpg)
56
yx
3q
x yTime 11
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 57: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/57.jpg)
57
yx
3q
x yTime 12
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
L,##
# # #}{ nnba
![Page 58: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/58.jpg)
58
yx
4q
x y
0q 1q 2q3qRxa ,
Raa ,Ryy ,
Lyb ,
Laa ,Lyy ,
Rxx ,
Ryy ,
Ryy ,4q
Halt & Accept
Time 13
L,##
# # #}{ nnba
![Page 59: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/59.jpg)
59
If we modify the
machine for the language }{ nnba
we can easily construct
a machine for the language }{ nnn cba
Observation
![Page 60: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/60.jpg)
60
Formal Definitions for
Turing Machines
![Page 61: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/61.jpg)
61
Transition Function
1q 2qRba ,
),,(),( 21 Rbqaq
![Page 62: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/62.jpg)
62
1q 2qLdc ,
),,(),( 21 Ldqcq
Transition Function
![Page 63: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/63.jpg)
63
Turing Machine
),#,,,,,( 0 FqQM
Transition
functionInitial
stateblank
Final
states
States
Input
alphabetTape
alphabet
![Page 64: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/64.jpg)
64
Instantaneous description:
ba
1q
ac
baqca 1
Configuration
# # # #
![Page 65: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/65.jpg)
65
Time 4 Time 5
yx
2q
a b yx
0q
a b
A move:aybqxxaybq 02
# # # # # #
![Page 66: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/66.jpg)
66
Time 4 Time 5
yx
2q
a b yx
0q
a b
bqxxyybqxxaybqxxaybq 1102
Time 6 Time 7
yx
1q
x b yx
1q
x b
# # # # # #
# # # # # #
![Page 67: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/67.jpg)
67
bqxxyxaybq 12
Equivalent notation:
bxxqybxxqaybxqxaybq 1102
![Page 68: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/68.jpg)
68
Initial configuration: wq0
ba
0q
a b
w
Input string
# # #
![Page 69: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/69.jpg)
69
For any Turing Machine M
}:{)( 210 xqxwqwML f
Initial state Final state
The Accepted Language
![Page 70: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/70.jpg)
70
Standard Turing Machine
• Deterministic
• Infinite tape in both directions
•Tape is the input/output file
The machine we described is the standard:
![Page 71: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/71.jpg)
71
Computing Functionswith
Turing Machines
![Page 72: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/72.jpg)
72
A function )(wf has:
Domain
(domän):
DDw
Range
(värdemängd):
S Swf )(
![Page 73: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/73.jpg)
73
A function may have many parameters:
yxyxf ),(
Example: Addition function
![Page 74: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/74.jpg)
74
Integer Domain
Binary: 101
Decimal: 5
We prefer unary representation:
easier to manipulate
Unary: 11111
![Page 75: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/75.jpg)
75
Definition
A function is computable if
there is a Turing Machine such that:
fM
Initial configuration Final configuration
Dw Domain
fq
)(wf
final state0q
w
initial state
For all
# # # #
![Page 76: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/76.jpg)
76
)(0 wfqwq f
Initial
Configuration
Final
Configuration
In other words
Dw DomainFor all
A function is computable if
there is a Turing Machine such that
fM
![Page 77: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/77.jpg)
77
Example (Addition)
The function yxyxf ),( is computable
Turing Machine:
Input string: yx0 unary
Output string: 0xy unary
yx, are integers
![Page 78: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/78.jpg)
78
Start
Finish 0
fq
11
yx
11
final state
0
0q
1 11 1
x y
1
initial state
# #
# #
![Page 79: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/79.jpg)
79
0q 1q 2q 3qL,## L,01
L,11
R,##
R,10
R,11
4q
R,11
Turing machine for function yxyxf ),(
![Page 80: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/80.jpg)
80
Execution Example:
11x
11y
Time 0
0
0q
1 11 1x y
Final Result
0
4q
1 11 1
yx
(2)
(2)
# #
# #
![Page 81: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/81.jpg)
81
Time 0 0
0q
1 11 1
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 82: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/82.jpg)
82
0q
01 11 1Time 1
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 83: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/83.jpg)
83
0
0q
1 11 1Time 2
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 84: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/84.jpg)
84
1q
1 11 11Time 3
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 85: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/85.jpg)
85
1q
1 11 11Time 4
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 86: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/86.jpg)
86
1q
1 11 11Time 5
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 87: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/87.jpg)
87
2q
1 11 11Time 6
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 88: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/88.jpg)
88
3q
1 11 01Time 7
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 89: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/89.jpg)
89
3q
1 11 01Time 8
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 90: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/90.jpg)
90
3q
1 11 01Time 9
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 91: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/91.jpg)
91
3q
1 11 01Time 10
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 92: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/92.jpg)
92
3q
1 11 01Time 11
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 93: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/93.jpg)
93
4q
1 11 01
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
HALT & accept
Time 12 # #
L,##
R,##
yxyxf ),(
![Page 94: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/94.jpg)
94
Another Example (Multiplication)
The function xxf 2)( is computable
Turing Machine
Input string: x unary
Output string: xx unary
x is integer
![Page 95: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/95.jpg)
95
Start
Finish 1
fq
11
x2
11
final state
0q
11
x
1
initial state
# #
# #
![Page 96: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/96.jpg)
96
Turing Machine Pseudocode for xxf 2)(
• Replace every 1 with $
• Repeat:
• Find rightmost $, replace it with 1
• Go to right end, insert 1
Until no more $ remain
![Page 97: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/97.jpg)
97
0q 1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
Turing Machine for xxf 2)(
![Page 98: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/98.jpg)
98
0q
11
3q
1 11 1
Start Finish
# # # #
0q 1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
xxf 2)(
![Page 99: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/99.jpg)
99
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
0q
1Time 0 # # # #
0q
1 xxf 2)(
![Page 100: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/100.jpg)
100
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
0q
1$Time 1 # # # #
0q
xxf 2)(
![Page 101: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/101.jpg)
101
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
0q
Time 2 # # # #
0q
$ $ xxf 2)(
![Page 102: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/102.jpg)
102
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
1q
Time 3 # # # #
0q
$ $ xxf 2)(
![Page 103: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/103.jpg)
103
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
2q
1Time 4 # # # #
0q
$ xxf 2)(
![Page 104: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/104.jpg)
104
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
1q
1 1Time 5 # # #
0q
$ xxf 2)(
![Page 105: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/105.jpg)
105
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
1q
1 1Time 6 # # #
0q
$ xxf 2)(
![Page 106: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/106.jpg)
106
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
2q
1 1Time 7 # # #
0q
xxf 2)( 1
![Page 107: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/107.jpg)
107
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
2q
1 1Time 8 # # #
0q
xxf 2)( 1
![Page 108: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/108.jpg)
108
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
2q
1 1Time 9 # # #
0q
xxf 2)( 1
![Page 109: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/109.jpg)
109
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
11Time 10 # #
0q
1q
1 1 xxf 2)(
![Page 110: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/110.jpg)
110
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
11Time 11 # #
0q
1q
1 1 xxf 2)(
![Page 111: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/111.jpg)
111
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
11Time 12 # #
0q
1q
1 1 xxf 2)(
![Page 112: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/112.jpg)
112
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
11Time 13 # #
0q
1q
1 1 xxf 2)(
![Page 113: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/113.jpg)
113
1q 2q
3q
R,1$
L,1#
L,##
R$,1 L,11 R,11
R,##
11Time 14 # #
0q
3q
1 1 xxf 2)(
![Page 114: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/114.jpg)
114
Another Example
The function is computable
),( yxf0
1 yx
yx
if
if
Turing Machine for
Output: 1 0or
Input: yx0
![Page 115: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/115.jpg)
115
Turing Machine Pseudocode
Match a 1 from with a 1 from x y
• Repeat
Until all of or are matchedx y
• If a 1 from is not matched
erase tape, write 1
else
erase tape, write 0
x
![Page 116: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/116.jpg)
116
Combining Turing Machines
![Page 117: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/117.jpg)
117
Block Diagram
Turing
Machineinput output
![Page 118: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/118.jpg)
118
Example
),( yxf0
yx yx
yx
if
if
Comparer
Adder
Eraser
yx, yx
yx
yx
0
![Page 119: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/119.jpg)
119
Turing’s Thesis
![Page 120: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/120.jpg)
120
Do Turing machines have
the same power with
a digital computer?
Intuitive answer: Yes
There is no formal answer!
Question:
![Page 121: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/121.jpg)
121
Turing’s thesis
Any computation carried out
by mechanical means
can be performed by a Turing Machine
(1930)
http://www.engr.uconn.edu/~dqg/papers/myth.pdf The Origins of the Turing Thesis Myth Goldin & Wegner
![Page 122: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/122.jpg)
122
And, the other way round:
A computation is mechanical
if and only if
it can be performed by a Turing Machine
Strong Turing Thesis: There is no known model of computation
more powerful than Turing Machines
Wrong! Asynchronous parallel computation is more powerful than TM model, and cannot be reduced to TM.
![Page 123: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/123.jpg)
123
Definition of Algorithm
An algorithm for function
is a Turing Machine which computes
)(wf)(wf
![Page 124: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/124.jpg)
124
When we say
There exists an algorithm
Algorithms are Turing Machines
It means
There exists a Turing Machine
![Page 125: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/125.jpg)
125
Language Grammar Machine
Chomsky Hierarchy
Non-computable ??
Recursively enumerable (RE)
Unrestricted Turing machines 0
Recursive
Turing machines that always halt 0
Context-sensitive
Context-sensitive grammar
Linear-bounded automata 1
Context-free
Context-free grammar
Non-deterministic pushdown automata 2
Regular
Regular expressions Finite state automata 3
properly inclusive
Languages, Grammars, Machines
![Page 126: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/126.jpg)
126
Regular Languages
FINITE AUTOMATA
**ba
Context-free languages
PUSH-DOWN AUTOMATA
Unrestricted grammar languages
TURING MACHINES
}0:{ ncba nnn
}0:{ nba nn
}},{:{ bawww
}*},{:{ bawwwR
}0:{ ! nan }0:{2
nba nn
![Page 127: CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12](https://reader037.vdocument.in/reader037/viewer/2022102808/56812ec1550346895d9462bc/html5/thumbnails/127.jpg)
Interesting further reading
Computational and evolutionary aspects of language
http://www.nature.com/nature/journal/v417/n6889/full/nature00771.html
Turing’s thesis
http://www.ams.org/notices/200610/fea-feferman.pdf
http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408
2012 The Alan Turing World
https://sites.google.com/site/naturalcomputingaisbiacap2012 Symposium on Natural/Unconventional Computing AISB/IACAP World Congress
127