Regular expression require an equal number of left and right parentheses, which cannot be expressed by a finite state acceptor. In fact, any programming languages using parentheses, such as lisp, are not regular.
an equal number of left and right parentheses, which cannot be expressed by a finite state acceptor. unless the number of parentheses is limited.
which it is, because no computer has an unlimited amount of memory.
>>8 an equal number of left and right parentheses, which cannot be expressed by a finite state acceptor
You're correct, but this is not a formal argument. Try using the pumping lemma
>>20
I admire your attempt to troll, but regular languages are defined in terms of finite state machines, and the input to these machines can be arbitrarily large.