| ??? 03/18/02 16:19 Read: times |
#20936 - RE: Automata theory |
hi
PDA is a finite state machine with PDS(push down store). A PDA accepts a Context free grammer. for more detail go for AHO ULMANN or MARTIN Book. for best results don't forget to use google search engine. :) abs |
| Topic | Author | Date |
| Automata theory | 01/01/70 00:00 | |
| RE: Automata theory | 01/01/70 00:00 | |
| RE: Automata theory | 01/01/70 00:00 | |
RE: Automata theory | 01/01/70 00:00 |



