On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday.

First Page		Document Content
Date: 2014-12-18 08:35:34 Finite-state machine Computing Mathematics Deterministic pushdown automaton Automata theory Models of computation Nondeterministic finite automaton		On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday. Add to Reading List Source URL: markburgess.org Download Document from Source Website File Size: 248,32 KB Share Document on Facebook

	Simulation of Two-Way Pushdown Automata Revisited Robert Gl¨uck DIKU, Dept. of Computer Science, University of Copenhagen Dedicated to David A. Schmidt on the Occasion of his 60th Birthday DocID: 1q0N1 - View Document
	Pushdown Automata on (PDA) is essentially an A pushdown automata -NFA with a stack. On a transition the PDA: DocID: 1pWaV - View Document
	The Halting Problems of Network Stack Insecurity Le n S a s s a m a n , M e r e d i t h L . P a t t e r s o n , Se r g e y B r a t u s , and Anna Shubina Len Sassaman was a PhD DocID: 1fMId - View Document
	Security Applications of Formal Language Theory Dartmouth Computer Science Technical Report TR2011-709 Len Sassaman, Meredith L. Patterson, Sergey Bratus, Michael E. Locasto, Anna Shubina DocID: 1fymv - View Document
	The Halting Problems of Network Stack Insecurity Le n S a s s a m a n , M e r e d i t h L . P a t t e r s o n , Se r g e y B r a t u s , and Anna Shubina Len Sassaman was a PhD DocID: 1aVZM - View Document