Chapter 8Other Models of Discontinuous Computation
We have been careful not to say that the jumping formal models given in this book are the only formalizations of discontinuous computation. In fact, formal language theory has introduced numerous other alternatives for this purpose. Out of these, the present chapter highlights a few that appear to be of a great interest.
Section 8.1 discusses deep pushdown automata, which represent modified versions of ordinary pushdown automata. Specifically, these modified versions can rewrite non-input symbols deeper than on the very top of their pushdown lists. Section 8.2 formalizes discontinuous computation by grammars and automata working with unordered strings. Section 8.3 continues with the discussion ...
Get Jumping Computation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
