Abstract
Recall that jumping grammars (see Chap. 5) represent language-generating models for discontinuous computation. The present chapter explores their automata-based counterparts, called jumping automata. As their name suggests, they jump across their input words discontinuously, and in this way, they also formalize computation performed in a discontinuous way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
S. Buettcher, C.L.A. Clarke, G.V. Cormack, Information Retrieval: Implementing and Evaluating Search Engines (MIT Press, Cambridge, 2010)
B. Bouchon-Meunier, G. Coletti, R.R. Yager (eds.), Modern Information Processing: From Theory to Applications (Elsevier Science, New York, 2006)
R. Baeza-Yates, B. Ribeiro-Neto, Modern Information Retrieval: The Concepts and Technology behind Search, 2nd edn. (Addison-Wesley Professional, Boston, 2011)
D.A. Grossman, O. Frieder, Information Retrieval: Algorithms and Heuristics, 2nd edn. (Springer, Berlin, 2004)
A. Meduna, Automata and Languages: Theory and Applications (Springer, London, 2000)
C.D. Manning, P. Raghavan, H. Schütze, Introduction to Information Retrieval (Cambridge University Press, New York, 2008)
N. Nisan, S. Schocken, The Elements of Computing Systems: Building a Modern Computer from First Principles (MIT Press, Cambridge, 2005)
S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, 2nd edn. (Prentice-Hall, New Jersey, 2002)
A. Salomaa, Formal Languages (Academic Press, London, 1973)
V. Vorel, On basic properties of jumping finite automata. CoRR, abs/1511.08396, 2015
D. Wood, Theory of Computation: A Primer (Addison-Wesley, Boston, 1987)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Meduna, A., Soukup, O. (2017). Jumping Automata and Discontinuous Computation. In: Modern Language Models and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-63100-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-63100-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63099-1
Online ISBN: 978-3-319-63100-4
eBook Packages: Computer ScienceComputer Science (R0)