• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Self-verifying finite automaton     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

In automata theory, a self-verifying finite automaton (SVFA)is a special kind of a nondeterministic finite automaton (NFA)with a symmetric kind of nondeterminismintroduced 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 pathsmay give contradictory answers,namely both answers yes and no on the same input are not possible.At least one path must give answer yes or no,and if it is yes then the string is considered accepted.SVFA accept the same class of languages as deterministic finite automata (DFA)and NFA but have different state complexity.