-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathturingmachine.js
More file actions
202 lines (182 loc) · 4.97 KB
/
turingmachine.js
File metadata and controls
202 lines (182 loc) · 4.97 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
/**
* Turing machine simulation
*
* @Author: Andreas Rieger, s82456@bht-berlin.de
* Date: 2022-01-23, updated: 2022-02-04
*/
const blank = '_'; // using the underscores ('_') instead of blanks / spaces (' ') for testing purpose
/**
* Machine configuration
*
* Every object represents a curState with different transitions.
* Every transition consists of key (tape read) and 3 statements: write, moving direction and new curState.
*
*/
const states = [
// curState 0
{
[blank]: [blank, 'R', 0],
'B': [blank, 'R', 1]
},
// curState 1
{
'T': ['T', 'R', 2],
'P': ['P', 'R', 2]
},
// curState 2
{
'B': [blank, 'R', 3]
},
// curState 3
{
'T': [blank, 'R', 4],
'P': [blank, 'R', 6]
},
// curState 4
{
'S': [blank, 'R', 4],
'X': [blank, 'R', 5]
},
// curState 5
{
'X': [blank, 'R', 6],
'S': [blank, 'R', 8]
},
// curState 6
{
'T': [blank, 'R', 6],
'V': [blank, 'R', 7]
},
// curState 7
{
'P': [blank, 'R', 5],
'V': [blank, 'R', 8]
},
// curState 8
{
'E': [blank, 'R', 9]
},
// curState 9
{
'T': [blank, 'L', 10],
'P': [blank, 'L', 11]
},
// curState 10
{
[blank]: [blank, 'L', 10],
'T': [blank, 'R', 12]
},
// curState 11
{
[blank]: [blank, 'L', 11],
'P': [blank, 'R', 12]
},
// curState 12
{
[blank]: [blank, 'R', 12],
'E': [blank, 'R', 13]
},
// curState 13
{
[blank]: [blank, 'N', 13]
}
];
/**
* This class is defining a turing machine.
* The class' constructor is expecting a word to work with.
*/
class Turingmachine {
constructor(word) {
// creating array from word
const tape = Array.from(word.trim());
// adding a blank to mark the end of word
tape.push(blank);
const firstChar = (element) => element != blank;
this.word = tape.slice(tape.findIndex(firstChar))
this.states = states;
this.accepted = false;
this.blank = blank;
this.log = [];
let
curState = 0,
nextState = 0,
head = 0
;
/**
* Recursive method to control the machine's flow
*/
const operations = () => {
// making configuration details
// shorter and more readable
const read = tape[head];
// running through the configuration without errors
// while reading only valid chars from tape
if (typeof states[curState][read] !== "undefined") {
// making configuration details shorter and more readable
const write = states[curState][read][0];
const move = states[curState][read][1];
nextState = states[curState][read][2];
// Ignoring initial 'blanks' and
// moving the head to the first char without logging
if (curState == 0 && tape[head] == blank) {
head++;
operations();
}
// moving head to the right
else if (move == 'R') {
this.logResult(curState, head, read, write, move, nextState);
curState = nextState;
tape[head] = write;
head++;
operations();
}
// moving head to the left
else if (move == 'L') {
this.logResult(curState, head, read, write, move, nextState);
curState = nextState;
tape[head] = write;
head--;
operations();
}
// reaching end of tape, succeeding
else {
this.logResult(curState, head, read, write, move, nextState);
this.accepted = true;
}
}
// leaving the loop while reading unknown char from tape
else {
// console.log(`unknown char ${read} at head pos. ${head} in state ${curState}`);
this.logResult(curState, head, read, read, 'N', nextState);
}
}
operations(); // starting program routine
}
/**
* Logging state transition results
*
* @param {*} curState
* @param {*} head
* @param {*} read
* @param {*} write
* @param {*} move
* @param {*} nextState
*/
logResult(curState, head, read, write, move, nextState) {
this.log.push({
curState: curState,
head: head,
read: read,
write: write,
move: move,
nextState: nextState
});
}
}
/**
* node test
*/
(() => {
console.log("Test...");
console.log(new Turingmachine("###BPBPVVEPE#"));
})()