![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to mindfa.out CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Research Unix] / researchv10dc / cmd / icon / tests / stand|
Return to mindfa.out CVS log | Up to [Research Unix] / researchv10dc / cmd / icon / tests / stand |
1.1 root 1: Enter states (1 character names): Enter input alphabet: Enter Final states (subset of states): What is the start state? enter delta(a,0) = enter delta(a,1) = enter delta(b,0) = enter delta(b,1) = enter delta(c,0) = enter delta(c,1) = enter delta(d,0) = enter delta(d,1) = enter delta(e,0) = enter delta(e,1) = enter delta(f,0) = enter delta(f,1) = enter delta(g,0) = enter delta(g,1) = enter delta(h,0) = enter delta(h,1) =
2:
3:
4: Original Deterministic Finite Automaton is:
5:
6: (Q,S,delta,q0,F)
7:
8: where:
9:
10: Q = {a,b,c,d,e,f,g,h}
11: S = {0,1}
12: F = {d}
13: Start state is a
14: Delta:
15: d(a,0) = b d(a,1) = a
16: d(b,0) = a d(b,1) = c
17: d(c,0) = d d(c,1) = b
18: d(d,0) = d d(d,1) = a
19: d(e,0) = d d(e,1) = f
20: d(f,0) = g d(f,1) = e
21: d(g,0) = f d(g,1) = g
22: d(h,0) = g d(h,1) = d
23:
24:
25:
26: Reduced Deterministic Finite Automaton is:
27:
28: (Q,S,delta,q0,F)
29:
30: where:
31:
32: Q = {ag,bf,ce,d}
33: S = {0,1}
34: F = {d}
35: Start state is ag
36: Delta:
37: d(ag,0) = bf d(ag,1) = ag
38: d(bf,0) = ag d(bf,1) = ce
39: d(ce,0) = d d(ce,1) = bf
40: d(d,0) = d d(d,1) = ag
41:
42:
43:
44: Original Deterministic Finite Automaton is:
45:
46: (Q,S,delta,q0,F)
47:
48: where:
49:
50: Q = {a,b,c,d,e,f,g,h}
51: S = {0,1}
52: F = {d}
53: Start state is a
54: Delta:
55: d(a,0) = b d(a,1) = a
56: d(b,0) = a d(b,1) = c
57: d(c,0) = d d(c,1) = b
58: d(d,0) = d d(d,1) = a
59: d(e,0) = d d(e,1) = f
60: d(f,0) = g d(f,1) = e
61: d(g,0) = f d(g,1) = g
62: d(h,0) = g d(h,1) = d
63:
64:
65:
66: Reduced Deterministic Finite Automaton is:
67:
68: (Q,S,delta,q0,F)
69:
70: where:
71:
72: Q = {ag,bf,ce,d}
73: S = {0,1}
74: F = {d}
75: Start state is ag
76: Delta:
77: d(ag,0) = bf d(ag,1) = ag
78: d(bf,0) = ag d(bf,1) = ce
79: d(ce,0) = d d(ce,1) = bf
80: d(d,0) = d d(d,1) = ag
81:
82:
83:
84: Original Deterministic Finite Automaton is:
85:
86: (Q,S,delta,q0,F)
87:
88: where:
89:
90: Q = {a,b,c,d,e,f,g,h}
91: S = {0,1}
92: F = {d}
93: Start state is a
94: Delta:
95: d(a,0) = b d(a,1) = a
96: d(b,0) = a d(b,1) = c
97: d(c,0) = d d(c,1) = b
98: d(d,0) = d d(d,1) = a
99: d(e,0) = d d(e,1) = f
100: d(f,0) = g d(f,1) = e
101: d(g,0) = f d(g,1) = g
102: d(h,0) = g d(h,1) = d
103:
104:
105:
106: Reduced Deterministic Finite Automaton is:
107:
108: (Q,S,delta,q0,F)
109:
110: where:
111:
112: Q = {ag,bf,ce,d}
113: S = {0,1}
114: F = {d}
115: Start state is ag
116: Delta:
117: d(ag,0) = bf d(ag,1) = ag
118: d(bf,0) = ag d(bf,1) = ce
119: d(ce,0) = d d(ce,1) = bf
120: d(d,0) = d d(d,1) = ag
121:
122:
123:
124: Original Deterministic Finite Automaton is:
125:
126: (Q,S,delta,q0,F)
127:
128: where:
129:
130: Q = {a,b,c,d,e,f,g,h}
131: S = {0,1}
132: F = {d}
133: Start state is a
134: Delta:
135: d(a,0) = b d(a,1) = a
136: d(b,0) = a d(b,1) = c
137: d(c,0) = d d(c,1) = b
138: d(d,0) = d d(d,1) = a
139: d(e,0) = d d(e,1) = f
140: d(f,0) = g d(f,1) = e
141: d(g,0) = f d(g,1) = g
142: d(h,0) = g d(h,1) = d
143:
144:
145:
146: Reduced Deterministic Finite Automaton is:
147:
148: (Q,S,delta,q0,F)
149:
150: where:
151:
152: Q = {ag,bf,ce,d}
153: S = {0,1}
154: F = {d}
155: Start state is ag
156: Delta:
157: d(ag,0) = bf d(ag,1) = ag
158: d(bf,0) = ag d(bf,1) = ce
159: d(ce,0) = d d(ce,1) = bf
160: d(d,0) = d d(d,1) = ag
161:
162:
163:
164: Original Deterministic Finite Automaton is:
165:
166: (Q,S,delta,q0,F)
167:
168: where:
169:
170: Q = {a,b,c,d,e,f,g,h}
171: S = {0,1}
172: F = {d}
173: Start state is a
174: Delta:
175: d(a,0) = b d(a,1) = a
176: d(b,0) = a d(b,1) = c
177: d(c,0) = d d(c,1) = b
178: d(d,0) = d d(d,1) = a
179: d(e,0) = d d(e,1) = f
180: d(f,0) = g d(f,1) = e
181: d(g,0) = f d(g,1) = g
182: d(h,0) = g d(h,1) = d
183:
184:
185:
186: Reduced Deterministic Finite Automaton is:
187:
188: (Q,S,delta,q0,F)
189:
190: where:
191:
192: Q = {ag,bf,ce,d}
193: S = {0,1}
194: F = {d}
195: Start state is ag
196: Delta:
197: d(ag,0) = bf d(ag,1) = ag
198: d(bf,0) = ag d(bf,1) = ce
199: d(ce,0) = d d(ce,1) = bf
200: d(d,0) = d d(d,1) = ag
201:
202:
203:
204: Original Deterministic Finite Automaton is:
205:
206: (Q,S,delta,q0,F)
207:
208: where:
209:
210: Q = {a,b,c,d,e,f,g,h}
211: S = {0,1}
212: F = {d}
213: Start state is a
214: Delta:
215: d(a,0) = b d(a,1) = a
216: d(b,0) = a d(b,1) = c
217: d(c,0) = d d(c,1) = b
218: d(d,0) = d d(d,1) = a
219: d(e,0) = d d(e,1) = f
220: d(f,0) = g d(f,1) = e
221: d(g,0) = f d(g,1) = g
222: d(h,0) = g d(h,1) = d
223:
224:
225:
226: Reduced Deterministic Finite Automaton is:
227:
228: (Q,S,delta,q0,F)
229:
230: where:
231:
232: Q = {ag,bf,ce,d}
233: S = {0,1}
234: F = {d}
235: Start state is ag
236: Delta:
237: d(ag,0) = bf d(ag,1) = ag
238: d(bf,0) = ag d(bf,1) = ce
239: d(ce,0) = d d(ce,1) = bf
240: d(d,0) = d d(d,1) = ag
241:
242:
243:
244: Original Deterministic Finite Automaton is:
245:
246: (Q,S,delta,q0,F)
247:
248: where:
249:
250: Q = {a,b,c,d,e,f,g,h}
251: S = {0,1}
252: F = {d}
253: Start state is a
254: Delta:
255: d(a,0) = b d(a,1) = a
256: d(b,0) = a d(b,1) = c
257: d(c,0) = d d(c,1) = b
258: d(d,0) = d d(d,1) = a
259: d(e,0) = d d(e,1) = f
260: d(f,0) = g d(f,1) = e
261: d(g,0) = f d(g,1) = g
262: d(h,0) = g d(h,1) = d
263:
264:
265:
266: Reduced Deterministic Finite Automaton is:
267:
268: (Q,S,delta,q0,F)
269:
270: where:
271:
272: Q = {ag,bf,ce,d}
273: S = {0,1}
274: F = {d}
275: Start state is ag
276: Delta:
277: d(ag,0) = bf d(ag,1) = ag
278: d(bf,0) = ag d(bf,1) = ce
279: d(ce,0) = d d(ce,1) = bf
280: d(d,0) = d d(d,1) = ag
281:
282:
283:
284: Original Deterministic Finite Automaton is:
285:
286: (Q,S,delta,q0,F)
287:
288: where:
289:
290: Q = {a,b,c,d,e,f,g,h}
291: S = {0,1}
292: F = {d}
293: Start state is a
294: Delta:
295: d(a,0) = b d(a,1) = a
296: d(b,0) = a d(b,1) = c
297: d(c,0) = d d(c,1) = b
298: d(d,0) = d d(d,1) = a
299: d(e,0) = d d(e,1) = f
300: d(f,0) = g d(f,1) = e
301: d(g,0) = f d(g,1) = g
302: d(h,0) = g d(h,1) = d
303:
304:
305:
306: Reduced Deterministic Finite Automaton is:
307:
308: (Q,S,delta,q0,F)
309:
310: where:
311:
312: Q = {ag,bf,ce,d}
313: S = {0,1}
314: F = {d}
315: Start state is ag
316: Delta:
317: d(ag,0) = bf d(ag,1) = ag
318: d(bf,0) = ag d(bf,1) = ce
319: d(ce,0) = d d(ce,1) = bf
320: d(d,0) = d d(d,1) = ag
321:
322:
323:
324: Original Deterministic Finite Automaton is:
325:
326: (Q,S,delta,q0,F)
327:
328: where:
329:
330: Q = {a,b,c,d,e,f,g,h}
331: S = {0,1}
332: F = {d}
333: Start state is a
334: Delta:
335: d(a,0) = b d(a,1) = a
336: d(b,0) = a d(b,1) = c
337: d(c,0) = d d(c,1) = b
338: d(d,0) = d d(d,1) = a
339: d(e,0) = d d(e,1) = f
340: d(f,0) = g d(f,1) = e
341: d(g,0) = f d(g,1) = g
342: d(h,0) = g d(h,1) = d
343:
344:
345:
346: Reduced Deterministic Finite Automaton is:
347:
348: (Q,S,delta,q0,F)
349:
350: where:
351:
352: Q = {ag,bf,ce,d}
353: S = {0,1}
354: F = {d}
355: Start state is ag
356: Delta:
357: d(ag,0) = bf d(ag,1) = ag
358: d(bf,0) = ag d(bf,1) = ce
359: d(ce,0) = d d(ce,1) = bf
360: d(d,0) = d d(d,1) = ag
361:
362:
363:
364: Original Deterministic Finite Automaton is:
365:
366: (Q,S,delta,q0,F)
367:
368: where:
369:
370: Q = {a,b,c,d,e,f,g,h}
371: S = {0,1}
372: F = {d}
373: Start state is a
374: Delta:
375: d(a,0) = b d(a,1) = a
376: d(b,0) = a d(b,1) = c
377: d(c,0) = d d(c,1) = b
378: d(d,0) = d d(d,1) = a
379: d(e,0) = d d(e,1) = f
380: d(f,0) = g d(f,1) = e
381: d(g,0) = f d(g,1) = g
382: d(h,0) = g d(h,1) = d
383:
384:
385:
386: Reduced Deterministic Finite Automaton is:
387:
388: (Q,S,delta,q0,F)
389:
390: where:
391:
392: Q = {ag,bf,ce,d}
393: S = {0,1}
394: F = {d}
395: Start state is ag
396: Delta:
397: d(ag,0) = bf d(ag,1) = ag
398: d(bf,0) = ag d(bf,1) = ce
399: d(ce,0) = d d(ce,1) = bf
400: d(d,0) = d d(d,1) = ag
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.