Self-verifying finite automaton
id:
self-verifying-finite-automaton-199-1218962
title:
Self-verifying finite automaton
text:
In automata theory, a self-verifying finite automaton (SVFA)
is a special kind of a nondeterministic finite automaton (NFA)
with a symmetric kind of nondeterminism
introduced by Hromkovič and Schnitger.
Generally, in self-verifying nondeterminism,
each computation path is concluded with any of the three possible answers:
yes, no, and I do not know.
For each input string, no two paths
may give contradictory answers,
namely both answers yes and no on the same input are not possible.
At least one p
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Self-verifying_finite_automaton
date created:
date modified:
2024-03-08T23:09:54Z
main entity:
{"identifier":"Q30595455","url":"https://www.wikidata.org/entity/Q30595455"}
image:
fields total:
13
integrity:
13