All Questions
1 question
17
votes
4
answers
3k
views
Languages beyond enumerable
A language is a set of finite-length strings from some finite alphabet $\Sigma$.
It is no loss of generality (for my purposes) to take $\Sigma=\{0,1\}$; so a language is a set of bit-strings.
...
- 151k