Abstract
Indisputably, processing information in a largely discontinuous way has become a quite common computational phenomenon [BYRN11, BCC10, MRS08]. Indeed, consider a process p that deals with information i. During a single computational step, p can read a piece of information x in i, erase it, generate a new piece of information y, and insert y into i possibly far away from the original occurrence of x, which was erased. Therefore, intuitively speaking, during its computation, p keeps jumping across i as a whole. To explore computation like this systematically and rigorously, the language theory should provide computer science with language-generating models to explore various information processors mathematically, so it should do so for the purpose sketched above, too.
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)
R. Baeza-Yates, B. Ribeiro-Neto, Modern Information Retrieval: The Concepts and Technology behind Search, 2nd edn. (Addison-Wesley Professional, Boston, 2011)
N. Chomsky, On certain formal properties of grammars. Inf. Control 2, 137–167 (1959)
J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989)
H. Fernau, A. Meduna, A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. 86(5), 235–240 (2003)
S.A. Greibach, J.E. Hopcroft, Scattered context grammars. J. Comput. Syst. Sci. 3(3), 233–247 (1969)
S. Ginsburg, The Mathematical Theory of Context-free Languages (McGraw Hill, New York, 1966)
M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Boston, 1978)
M. Kudlek, C. Martín-Vide, Gh. Păun, Toward FMT (formal macroset theory), in Pre-proceedings of the Workshop on Multiset Processing, Curtea de Arges (2000), pp. 149–158
G. Madejski, Jumping and pumping lemmas and their applications, in Proceedings of NCMA 2016 - 8th Workshop on Non-Classical Models of Automata and Applications (2016), pp. 25–34
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)
A. Meduna, P. Zemek, Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012)
A. Salomaa, Formal Languages (Academic Press, London, 1973)
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 Grammars and Discontinuous Computation. In: Modern Language Models and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-63100-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-63100-4_5
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)