About: Intersection Non-Emptiness Problem     Goto   Sponge   NotDistinct   Permalink

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

The intersection non-emptiness problem (also known as finite automaton intersection problem and non-emptiness of intersection problem) is a PSPACE-complete decision problem from the field of automata theory.

AttributesValues
rdfs:label
  • Intersection Non-Emptiness Problem (en)
rdfs:comment
  • The intersection non-emptiness problem (also known as finite automaton intersection problem and non-emptiness of intersection problem) is a PSPACE-complete decision problem from the field of automata theory. (en)
dbp:wikiPageUsesTemplate
Subject
prov:wasDerivedFrom
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
has abstract
  • The intersection non-emptiness problem (also known as finite automaton intersection problem and non-emptiness of intersection problem) is a PSPACE-complete decision problem from the field of automata theory. (en)
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git151 as of Feb 20 2025


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 1006 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software