First Page | Document Content | |
---|---|---|
Date: 2009-05-20 09:48:41Pushdown automaton Deterministic pushdown automaton Pumping lemma for regular languages Field extension Mathematics Applied mathematics Automata theory Models of computation Formal languages | Se ond-Order Simple Grammars Colin Stirling S hool of Informati s University of Edinburgh Edinburgh EH9 3JZ, UKAdd to Reading ListSource URL: homepages.inf.ed.ac.ukDownload Document from Source WebsiteFile Size: 214,96 KBShare Document on Facebook |