is the language of regular expressions a regular language?

From: TheGist <thegist@xxxxxxxxxx>
Date: Sat, 06 Jan 2007 01:57:04 -0500

The set REX of regular expressions over the alphabet
{a, b}
is itself a language over the alphabet
{e,0 , a, b, ), (*,U, .}

is this language regular?

I want to say yes, however, I am not sure what approach to take?
Which would be easiest? Construct a DFA or a regular expression?
Or am I wrong and this language is not regular?
.

Follow-Ups:
- Re: is the language of regular expressions a regular language?
  - From: ron
- Re: is the language of regular expressions a regular language?
  - From: ron
- Re: is the language of regular expressions a regular language?
  - From: Ralph
- Re: is the language of regular expressions a regular language?
  - From: Jussi Piitulainen

Prev by Date: Re: need help.trying to brush up on finite automata for the spring quals
Next by Date: Re: is the language of regular expressions a regular language?
Previous by thread: Replicating the memory tape in neumanns universal constructor
Next by thread: Re: is the language of regular expressions a regular language?
Index(es):
- Date
- Thread

Relevant Pages

Re: acceptance of forth (was: Re: continued fractions)
... But most every scripting language these days offers one ... this is provided by the language itself. ... is classic regular expressions are "greedy" so matching on shortest- ... string in that language and execute it), here are some of the big ...
(comp.lang.forth)
Decidabilty of a problem of regular languages
... where S is a finite number of states, A an alphabet, TO a finite set ... of transitions labeled with regular expressions sigma built from A. ... Exists a path between 's' and 'r', such that the language ... language generated by alpha? ...
(comp.theory)
Re: Regular express for
,