First Page | Document Content | |
---|---|---|
Date: 2009-06-22 08:52:31Mathematics Formal languages Computer science Finite state transducer Finite-state machine Nondeterministic finite automaton Petri net FO Variable Automata theory Models of computation Theoretical computer science | Algorithmic Analysis of Array-Accessing Programs ? ˇ Rajeev Alur, Pavol Cern´ y, and Scott Weinstein University of PennsylvaniaAdd to Reading ListSource URL: www.cis.upenn.eduDownload Document from Source WebsiteFile Size: 217,06 KBShare Document on Facebook |