This HTML5 document contains 28 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-srhttp://sr.dbpedia.org/resource/
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:SPIN_model_checker
dbo:wikiPageWikiLink
dbr:Bitstate_hashing
Subject Item
dbr:Bitstate_hashing
rdf:type
yago:Abstraction100002137 yago:MathematicalRelation113783581 dbo:Software yago:Function113783816 yago:WikicatHashFunctions yago:Relation100031921
rdfs:label
Bitstate hashing
rdfs:comment
Bitstate hashing is a hashing method invented in 1968 by Morris. It is used for state hashing, where each state (e.g. of an automaton) is represented by a number and it is passed to some hash function. The result of the function is then taken as the index to an array of bits (a bit-field), where one looks for 1 if the state was already seen before or stores 1 by itself if not. It usually serves as a yes–no technique without a need of storing whole state bit representation.
dcterms:subject
dbc:Hash_functions
dbo:wikiPageID
21890341
dbo:wikiPageRevisionID
1037850047
dbo:wikiPageWikiLink
dbr:SPIN_model_checker dbr:Bit-field dbc:Hash_functions dbr:Hash_function dbr:Depth-first_search
owl:sameAs
freebase:m.05p9d3_ wikidata:Q4918950 dbpedia-sr:Bitstate_hashing yago-res:Bitstate_hashing n17:4ZDX3
dbo:abstract
Bitstate hashing is a hashing method invented in 1968 by Morris. It is used for state hashing, where each state (e.g. of an automaton) is represented by a number and it is passed to some hash function. The result of the function is then taken as the index to an array of bits (a bit-field), where one looks for 1 if the state was already seen before or stores 1 by itself if not. It usually serves as a yes–no technique without a need of storing whole state bit representation. A shortcoming of this framework is losing precision like in other hashing techniques. Hence some tools use this technique with more than one hash function so that the bit-field gets widened by the number of used functions, each having its own row. And even after all functions return values (the indices) point to fields with contents equal to 1, the state may be uttered as visited with much higher probability.
gold:hypernym
dbr:Method
prov:wasDerivedFrom
wikipedia-en:Bitstate_hashing?oldid=1037850047&ns=0
dbo:wikiPageLength
1554
foaf:isPrimaryTopicOf
wikipedia-en:Bitstate_hashing
Subject Item
wikipedia-en:Bitstate_hashing
foaf:primaryTopic
dbr:Bitstate_hashing