Re: How to write this RE?

bromage@cs.mu.OZ.AU (Andrew Bromage)
19 Aug 1996 23:10:39 -0400

          From comp.compilers
Related articles
How to write this RE? sc7099011@ntuvax.ntu.ac.sg (Johnny Wong) (1996-08-11)
Re: How to write this RE? fjh@mundook.cs.mu.OZ.AU (1996-08-13)
Re: How to write this RE? eadengle@dino.uwaterloo.ca (1996-08-13)
Re: How to write this RE? rwatson@CAM.ORG (Richard Edward Watson) (1996-08-15)
Re: How to write this RE? bart@time.cirl.uoregon.edu (1996-08-16)
Re: How to write this RE? torbenm@diku.dk (1996-08-16)
Re: How to write this RE? bromage@cs.mu.OZ.AU (1996-08-19)
| List of all articles for this month |
From: bromage@cs.mu.OZ.AU (Andrew Bromage)
Newsgroups: comp.compilers
Date: 19 Aug 1996 23:10:39 -0400
Organization: Comp Sci, University of Melbourne
References: 96-08-034
Keywords: lex

G'day all.


Johnny Wong <sc7099011@ntuvax.ntu.ac.sg> writes:


> Give the regular definitions for the following language:
> All strings of digits with no repeated digits.


If you're allowed to use the interleave product operator, there is a
rather compact representation for it:


0? x 1? x 2? x 3? x 4? x 5? x 6? x 7? x 8? x 9?


Where E? = (\lambda | E) and 'x' is interleave product.


Cheers,
Andrew Bromage
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.