Re: is the language of regular expressions a regular language?
- From: TheGist <fake@xxxxxxxxxx>
- Date: Tue, 09 Jan 2007 17:33:16 -0500
ron wrote:
Intuitively,to ensure that the parentheses are balanced,we need a
stack.
So we need s PDA to describe it at least. So it's not a RL.
Wow, the answer is so straightforward...
As you can see I am still building up my intuitive "toolbox"...
Well, thanks for the help!
.
- References:
- Prev by Date: Re: Can anyone explain this "job offer" puzzle?
- Next by Date: Maximal DAG within a graph?
- Previous by thread: Re: is the language of regular expressions a regular language?
- Next by thread: Quantum computable functions
- Index(es):
