Jumping Grammars and Discontinuous Computation

  • Alexander Meduna
  • Ondřej Soukup
Chapter

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.

Bibliography

  1. [BCC10]
    S. Buettcher, C.L.A. Clarke, G.V. Cormack, Information Retrieval: Implementing and Evaluating Search Engines (MIT Press, Cambridge, 2010)MATHGoogle Scholar
  2. [BYRN11]
    R. Baeza-Yates, B. Ribeiro-Neto, Modern Information Retrieval: The Concepts and Technology behind Search, 2nd edn. (Addison-Wesley Professional, Boston, 2011)Google Scholar
  3. [Cho59]
    N. Chomsky, On certain formal properties of grammars. Inf. Control 2, 137–167 (1959)MathSciNetCrossRefMATHGoogle Scholar
  4. [DP89]
    J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989)CrossRefMATHGoogle Scholar
  5. [FM03b]
    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)MathSciNetCrossRefMATHGoogle Scholar
  6. [GH69]
    S.A. Greibach, J.E. Hopcroft, Scattered context grammars. J. Comput. Syst. Sci. 3(3), 233–247 (1969)MathSciNetCrossRefMATHGoogle Scholar
  7. [Gin66]
    S. Ginsburg, The Mathematical Theory of Context-free Languages (McGraw Hill, New York, 1966)MATHGoogle Scholar
  8. [Har78]
    M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Boston, 1978)MATHGoogle Scholar
  9. [KMVP00]
    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–158Google Scholar
  10. [Mad16]
    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–34Google Scholar
  11. [Med00a]
    A. Meduna, Automata and Languages: Theory and Applications (Springer, London, 2000)CrossRefMATHGoogle Scholar
  12. [MRS08]
    C.D. Manning, P. Raghavan, H. Schütze, Introduction to Information Retrieval (Cambridge University Press, New York, 2008)CrossRefMATHGoogle Scholar
  13. [MZ12a]
    A. Meduna, P. Zemek, Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012)MathSciNetCrossRefMATHGoogle Scholar
  14. [Sal73]
    A. Salomaa, Formal Languages (Academic Press, London, 1973)MATHGoogle Scholar
  15. [Woo87]
    D. Wood, Theory of Computation: A Primer (Addison-Wesley, Boston, 1987)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Alexander Meduna
    • 1
  • Ondřej Soukup
    • 2
  1. 1.Department of Computer ScienceBrno University of TechnologyBrnoCzech Republic
  2. 2.Department of Information TechnologyBrno University of TechnologyBrnoCzech Republic

Personalised recommendations