Regular Languages
From: Behrang (bassemi_at_math.sharif.edu)
Date: 01/25/04
- Next message: Pento: "Re: Turing machine"
- Previous message: Matt: "Re: Algorithm to generate all possible deals"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 25 Jan 2004 03:50:25 -0800
Hi everybody,
Is it possible to represent each regular language with a planar NFA graph?
Cheers,
Behrang.
- Next message: Pento: "Re: Turing machine"
- Previous message: Matt: "Re: Algorithm to generate all possible deals"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
