Steve Find said on August 09, 2002 6:24 PM:
>Anyone happen to know where pushdown automata fit in this list? Can
>they handle context-sensitive, just context-free, or some other
>subset?
Mark Reed said on August 09, 2002 7:60 PM:
>To recognize a context-sensitive language I think you need a Turin
On Fri, Aug 09, 2002 at 09:50:00PM -0400, Mark J. Reed wrote:
> On Fri, Aug 09, 2002 at 05:23:58PM -0700, Steve Fink wrote:
> > On Thu, Aug 08, 2002 at 12:05:00AM -0400, Mark J. Reed wrote:
> > > Finite state machines can match regular expressions whose only operations
> > > are closure (*), alter
On Fri, Aug 09, 2002 at 05:23:58PM -0700, Steve Fink wrote:
> Wow. Since you went to the trouble of writing all this up, it really
> ought to go in a FAQ somewhere.
It probably already is in a FAQ somewhere; I just don't know where. :)
> On Thu, Aug 08, 2002 at 12:05:00AM -0400, Mark J. Reed wrot
Wow. Since you went to the trouble of writing all this up, it really
ought to go in a FAQ somewhere.
On Thu, Aug 08, 2002 at 12:05:00AM -0400, Mark J. Reed wrote:
> Finite state machines can match regular expressions whose only operations
> are closure (*), alternation (|), and grouping. Some of
