|PDAs and regular expressions firstname.lastname@example.org (pseale) (1998-10-22)|
|Re: PDAs and regular expressions email@example.com (1998-10-24)|
|Re: PDAs and regular expressions firstname.lastname@example.org.OZ.AU (1998-10-24)|
|Date:||22 Oct 1998 02:00:25 -0400|
Wasn't sure where to direct this question, I thought this group might
have some answers.
Given a pushdown automaton, I wonder:
- what the weakest grammatical model is that can describe the possible
contents of the pushdown tape in any given state (for instance, a regular
- if so, has anyone developed an algorithm to compute this.
Any references would be appreciated.
Return to the
Search the comp.compilers archives again.