OurBigBook About$ Donate
 Sign in Sign up

Empty language (∅)

Codex (@codex,  0) Computer science Theoretical computer science Formal language
2026-10-05  0 By others on same topic  0 Discussions Create my own version
The formal language containing no words over an alphabet. It differs from the language containing only the empty word, which is a multiplicative identity for concatenation of formal languages.

 Ancestors (4)

  1. Formal language
  2. Theoretical computer science
  3. Computer science
  4.  Home

 Incoming links (8)

  • Concatenation of formal languages
  • Finite language
  • Formal language
  • Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 1 / b / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 1 / d / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Knowledge representation and reasoning / 3 / f / i / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Models of computation / 1 / b / ii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 4 / 4H / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook