---
title: Emptiness problem
slug: emptiness-problem
qid: 
snapshot: enwiki-001313904683
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1313904683
tags: [20346051, 23468805, 26696192, 29265348, 62317677, 83865148]
---

# Emptiness problem

> [!note] Provenance
> Snapshot `enwiki-001313904683` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1313904683> · Licensed CC BY-SA 4.0

In theoretical computer science and formal language theory, a formal language is empty if its set of valid sentences is the empty set. The emptiness problem is the question of determining whether a language is empty given some representation of it, such as a finite-state automaton. For an automaton having n states, this is a decision problem that can be solved in O(n^2) time, or in time O(n+m) if the automaton has n states and m transitions. However, variants of that question, such as the emptiness problem for non-erasing stack automata, are PSPACE-complete. The emptiness problem in machine learning and formal languages determines if a model or automaton generates the empty language, which is undecidable for certain alternating multi-head finite automata over single-letter alphabets. The emptiness problem is undecidable for context-sensitive grammars, a fact that follows from the undecidability of the halting problem. It is, however, decidable for context-free grammars.

In theoretical computer science and formal language theory, a formal language is empty if its set of valid sentences is the empty set. The emptiness problem is the question of determining whether a language is empty given some representation of it, such as a finite-state automaton. For an automaton having n states, this is a decision problem that can be solved in O(n^2) time, or in time O(n+m) if the automaton has n states and m transitions. However, variants of that question, such as the emptiness problem for non-erasing stack automata, are PSPACE-complete. The emptiness problem in machine learning and formal languages determines if a model or automaton generates the empty language, which is undecidable for certain alternating multi-head finite automata over single-letter alphabets. The emptiness problem is undecidable for context-sensitive grammars, a fact that follows from the undecidability of the halting problem. It is, however, decidable for context-free grammars. ==References==
