3 ms·
Assuming that by "word" you mean a finite string over a non-empty alphabet, then there are infinitely many - only a finite subset of them have mathematical defi
by penteract 6y ago
Assuming that by "word" you mean a finite string over a non-empty alphabet, then there are infinitely many - only a finite subset of them have mathematical definitions :) .
- whatshisface 6y agoWould not every word also denote a regular expression, thereby having a mathematical definition?
- marcosdumay 6y agoCS is full of proofs that use all possible words or word sequence. The real test is if somebody actually wrote it in an undecipherable wikipedia page.