bn:22329505n
Noun Concept
Categories: Formal languages, Computer science stubs, Polynomial-time problems, PSPACE-complete problems, Undecidable problems
EN
emptiness problem  emptiness
EN
In theoretical computer science and formal language theory, a formal language is empty if its set of valid sentences is the empty set. Wikipedia
Definitions
Sources
EN
In theoretical computer science and formal language theory, a formal language is empty if its set of valid sentences is the empty set. Wikipedia
Wikipedia
Wikidata
Wikipedia Redirections