# 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):