我得到這個問題,讓我找出"Why is it foolish to write a regular expression for the language that consists of strings of 0's and 1's that are palindromes?"
(他們讀同樣的向前和向後)。1和0的正則表達式
問題的第二部分說,"using any formal mechanism of your choice, show how it is possible to express the language that consists of strings of 0's and 1's that are palindromes."
一般來說,有人問你自己要回答自己的問題,你至少應該解釋你自己得到了多少,然後纔有人可以解決如何向你解釋其餘的問題 – Gareth 2010-04-25 01:35:24