Deciding DPDA Equivalence is Primitive Recursive Colin Stirling

First Page		Document Content
Date: 2009-05-20 09:52:43 Symbol Pushdown automaton Constructible universe Ordinal number Automata theory Models of computation Deterministic pushdown automaton		Deciding DPDA Equivalence is Primitive Recursive Colin Stirling Add to Reading List Source URL: homepages.inf.ed.ac.uk Download Document from Source Website File Size: 319,39 KB Share Document on Facebook