15 Aug 1996 17:42:39 -0400

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

From: | Richard Edward Watson <rwatson@CAM.ORG> |

Newsgroups: | comp.compilers |

Date: | 15 Aug 1996 17:42:39 -0400 |

Organization: | Compilers Central |

References: | 96-08-034 |

Keywords: | lex, DFA |

Hi there,

Since the size of an alphabet is finite (say n) then the number of

passible words without repeating a symbol is also finite (assuming leading

zeros don't count). Since any finite language is regular, you have your

proof. The recursive solution is (at first prettier), but you cannot

construct an automaton from it neatly.

Richard

--

Richard E. Watson (Compiler Architect) | E-mail: rwatson@RibbitSoft.com

Ribbit Software Systems Inc. | Tel: + 1 (604) 762-6591

| FAX: + 1 (604) 762-6511

| WEB: www.RibbitSoft.com

| Address: Box 24040, 297 Bernard

| Kelowna, B.C.

| V1Y 9P9, Canada

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.