Set of Palindromes over 0, 1 forms Formal Language
Jump to navigation
Jump to search
Example of Formal Language
The set of palindromes over $\set {0, 1}$ forms a formal language.
Proof
$\set {0, 1}$ forms a set of symbols.
 | This needs considerable tedious hard slog to complete it. In particular: Demonstrate the unique readability property To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Finish}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.1$ Strings, Alphabets and Languages