343:
380:
547:
506:
36:
and
Schnitger. Generally, in self-verifying nondeterminism, each computation path is concluded with any of the three possible answers:
137:
29:
447:
Jirásková, Galina; Pighizzini, Giovanni (2011). "Optimal simulation of self-verifying automata by deterministic automata".
69:
530:
Jirásek, Jozef Štefan; Jirásková, Galina; Szabari, Alexander (2015). "Operations on Self-Verifying Finite
Automata".
577:
289:
483:
279:
270:
there is at least one accepting computation or at least one rejecting computation but not both.
33:
553:
543:
512:
502:
464:
429:
535:
494:
456:
419:
408:"On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata"
386:
73:
356:
48:. For each input string, no two paths may give contradictory answers, namely both answers
17:
571:
68:
then the string is considered accepted. SVFA accept the same class of languages as
539:
498:
557:
516:
468:
460:
433:
424:
407:
266:
then the computation is rejecting. There is a requirement that for each
534:. Lecture Notes in Computer Science. Vol. 9139. pp. 231–261.
85:
56:
on the same input are not possible. At least one path must give answer
493:. Lecture Notes in Computer Science. Vol. 9777. pp. 29–44.
484:"Self-Verifying Finite Automata and Descriptional Complexity"
353:-state SVFA such that the minimal equivalent DFA has exactly
32:(NFA) with a symmetric kind of nondeterminism introduced by
389:
of SVFA were obtained by Jirásková and her colleagues.
278:
Each DFA is a SVFA, but not vice versa. Jirásková and
359:
292:
374:
337:
345:states. Furthermore, for each positive integer
8:
532:Computer Science -- Theory and Applications
406:Hromkovič, Juraj; Schnitger, Georg (2001).
258:then the computation is accepting, and if r
491:Descriptional Complexity of Formal Systems
286:states, there exists an equivalent DFA of
423:
358:
322:
318:
291:
398:
338:{\displaystyle g(n)=\Theta (3^{n/3})}
84:An SVFA is represented formally by a
7:
308:
14:
72:(DFA) and NFA but have different
30:nondeterministic finite automaton
282:proved that for every SVFA of
197:with the following conditions:
22:self-verifying finite automaton
369:
363:
332:
311:
302:
296:
1:
70:deterministic finite automata
540:10.1007/978-3-319-20297-6_16
499:10.1007/978-3-319-41114-9_3
449:Information and Computation
412:Information and Computation
594:
482:Jirásková, Galina (2016).
28:) is a special kind of a
461:10.1016/j.ic.2010.11.017
178:is a sequence of states
155:are disjoint subsets of
425:10.1006/inco.2001.3040
376:
339:
385:Other results on the
377:
340:
375:{\displaystyle g(n)}
357:
290:
372:
349:, there exists an
335:
549:978-3-319-20296-9
508:978-3-319-41113-2
80:Formal definition
585:
562:
561:
527:
521:
520:
488:
479:
473:
472:
444:
438:
437:
427:
403:
387:state complexity
381:
379:
378:
373:
344:
342:
341:
336:
331:
330:
326:
159:. For each word
74:state complexity
593:
592:
588:
587:
586:
584:
583:
582:
578:Finite automata
568:
567:
566:
565:
550:
529:
528:
524:
509:
486:
481:
480:
476:
446:
445:
441:
405:
404:
400:
395:
355:
354:
314:
288:
287:
276:
265:
261:
257:
253:
236:
229:
222:
215:
205:
191:
187:
183:
172:
168:
164:
153:
146:
133:
126:
115:
108:
101:
82:
64:, and if it is
18:automata theory
12:
11:
5:
591:
589:
581:
580:
570:
569:
564:
563:
548:
522:
507:
474:
455:(3): 528–535.
439:
418:(2): 284–296.
397:
396:
394:
391:
371:
368:
365:
362:
334:
329:
325:
321:
317:
313:
310:
307:
304:
301:
298:
295:
275:
272:
263:
259:
255:
251:
248:
247:
234:
227:
220:
216:
211:
203:
189:
185:
181:
170:
166:
162:
151:
144:
131:
124:
113:
106:
99:
81:
78:
13:
10:
9:
6:
4:
3:
2:
590:
579:
576:
575:
573:
559:
555:
551:
545:
541:
537:
533:
526:
523:
518:
514:
510:
504:
500:
496:
492:
485:
478:
475:
470:
466:
462:
458:
454:
450:
443:
440:
435:
431:
426:
421:
417:
413:
409:
402:
399:
392:
390:
388:
383:
366:
360:
352:
348:
327:
323:
319:
315:
305:
299:
293:
285:
281:
273:
271:
269:
245:
241:
237:
230:
223:
217:
214:
210:
206:
200:
199:
198:
196:
192:
177:
173:
158:
154:
147:
140:
139:
134:
127:
120:
117:) such that (
116:
109:
102:
95:
91:
87:
79:
77:
75:
71:
67:
63:
59:
55:
51:
47:
46:I do not know
43:
39:
35:
31:
27:
23:
19:
531:
525:
490:
477:
452:
448:
442:
415:
411:
401:
384:
350:
346:
283:
277:
267:
249:
243:
239:
232:
225:
218:
212:
208:
201:
194:
179:
175:
160:
156:
149:
142:
136:
129:
122:
118:
111:
104:
97:
93:
89:
83:
65:
61:
57:
53:
49:
45:
41:
37:
25:
21:
15:
176:computation
393:References
280:Pighizzini
558:0302-9743
517:0302-9743
469:0890-5401
434:0890-5401
309:Θ
244:0, …, n−1
34:Hromkovič
572:Category
382:states.
135:) is an
121:, Σ, Δ,
96:, Σ, Δ,
274:Results
238:), for
86:6-tuple
556:
546:
515:
505:
467:
432:
188:, …, r
141:, and
44:, and
487:(PDF)
193:, in
161:w = a
554:ISSN
544:ISBN
513:ISSN
503:ISBN
465:ISSN
430:ISSN
250:If r
224:∈ Δ(
174:, a
52:and
26:SVFA
20:, a
536:doi
495:doi
457:doi
453:209
420:doi
416:169
262:∈ F
254:∈ F
235:i+1
221:i+1
169:… a
138:NFA
66:yes
60:or
58:yes
50:yes
38:yes
16:In
574::
552:.
542:.
511:.
501:.
489:.
463:.
451:.
428:.
414:.
410:.
242:=
231:,
207:=
184:,r
148:,
128:,
110:,
103:,
92:=(
88:,
76:.
62:no
54:no
42:no
40:,
560:.
538::
519:.
497::
471:.
459::
436:.
422::
370:)
367:n
364:(
361:g
351:n
347:n
333:)
328:3
324:/
320:n
316:3
312:(
306:=
303:)
300:n
297:(
294:g
284:n
268:w
264:r
260:n
256:a
252:n
246:.
240:i
233:a
228:i
226:r
219:r
213:0
209:q
204:0
202:r
195:Q
190:n
186:1
182:0
180:r
171:n
167:2
165:a
163:1
157:Q
152:r
150:F
145:a
143:F
132:a
130:F
125:0
123:q
119:Q
114:r
112:F
107:a
105:F
100:0
98:q
94:Q
90:A
24:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.