Bibliography
This bibliographical list contains all the publications referenced in the text. In addition, it includes some more useful references concerning the theory of languages and computation, many of which were published prior to the introduction of jumping automata and grammars. These publications discuss formal models, such as finite automata or context-free grammars, which underlie their jumping versions. Therefore, the reader without a solid background in these areas can treat them as useful references for a comfortable explanation of the necessary terminology, outlined in Chapter 1 extremely succinctly.
- Beier, S. and M. Holzer (2018a). Decidability of right one-way jumping finite automata. In Developments in Language Theory, DLT ...
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.
