Sliding Window Algorithms for Regular Languages

  • Moses Ganardi
  • Danny Hucke
  • Markus Lohrey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10792)


This paper gives a survey on recent results for sliding window streaming algorithms for regular languages. Details can be found in the recent papers [18, 19].


Automata theory Streaming algorithms Sliding window algorithms Regular languages 


  1. 1.
    Aggarwal, C.C.: Data Streams - Models and Algorithms. Springer, Heidelberg (2007). zbMATHGoogle Scholar
  2. 2.
    Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Arasu, A., Manku, G.S.: Approximate counts and quantiles over sliding windows. In: Proceedings of PODS 2004, pp. 286–296. ACM (2004)Google Scholar
  4. 4.
    Babcock, B., Datar, M., Motwani, R., O’Callaghan, L.: Maintaining variance and k-medians over data stream windows. In: Proceedings of PODS 2003, pp. 234–243. ACM (2003)Google Scholar
  5. 5.
    Babu, A., Limaye, N., Radhakrishnan, J., Varma, G.: Streaming algorithms for language recognition problems. Theor. Comput. Sci. 494, 13–23 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Babu, A., Limaye, N., Varma, G.: Streaming algorithms for some problems in log-space. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 94–104. Springer, Heidelberg (2010). CrossRefGoogle Scholar
  7. 7.
    Braverman, V.: Sliding window algorithms. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 2006–2011. Springer, Heidelberg (2016). CrossRefGoogle Scholar
  8. 8.
    Braverman, V., Ostrovsky, R.: Smooth histograms for sliding windows. In: Proceedings of FOCS 2007, pp. 283–293. IEEE Computer Society (2007)Google Scholar
  9. 9.
    Braverman, V., Ostrovsky, R., Zaniolo, C.: Optimal sampling from sliding windows. J. Comput. Syst. Sci. 78(1), 260–272 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Breslauer, D., Galil, Z.: Real-time streaming string-matching. ACM Trans. Algorithms 10(4), 22:1–22:12 (2014)Google Scholar
  11. 11.
    Clifford, R., Fontaine, A., Porat, E., Sach, B., Starikovskaya, T.: Dictionary matching in a stream. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 361–372. Springer, Heidelberg (2015). CrossRefGoogle Scholar
  12. 12.
    Clifford, R., Fontaine, A., Porat, E., Sach, B., Starikovskaya, T.: The k-mismatch problem revisited. In: Proceedings of SODA 2016, pp. 2039–2052. SIAM (2016)Google Scholar
  13. 13.
    Clifford, R., Starikovskaya, T.: Approximate hamming distance in a stream. In: Proceedings of ICALP 2016. LIPIcs, vol. 55, pp. 20:1–20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)Google Scholar
  14. 14.
    Crouch, M.S., McGregor, A., Stubbs, D.: Dynamic graphs in the sliding-window model. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 337–348. Springer, Heidelberg (2013). CrossRefGoogle Scholar
  15. 15.
    Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM J. Comput. 31(6), 1794–1813 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182–209 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    François, N., Magniez, F., de Rougemont, M., Serre, O.: Streaming property testing of visibly pushdown languages. In: Proceedings of ESA 2016. LIPIcs, vol. 57, pp. 43:1–43:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)Google Scholar
  18. 18.
    Ganardi, M., Hucke, D., König, D., Lohrey, M., Mamouras, K.: Automata theory on sliding windows. In: Proceedings of STACS 2018. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018, to appear)Google Scholar
  19. 19.
    Ganardi, M., Hucke, D., Lohrey, M.: Querying regular languages over sliding windows. In: Proceedings of FSTTCS 2016. LIPIcs, vol. 65, pp. 18:1–18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)Google Scholar
  20. 20.
    Golab, L., Özsu, M.T.: Processing sliding window multi-joins in continuous queries over data streams. In: Proceedings of VLDB 2003, pp. 500–511. Morgan Kaufmann (2003)Google Scholar
  21. 21.
    Krebs, A., Limaye, N., Srinivasan, S.: Streaming algorithms for recognizing nearly well-parenthesized expressions. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 412–423. Springer, Heidelberg (2011). CrossRefGoogle Scholar
  22. 22.
    Magniez, F., Mathieu, C., Nayak, A.: Recognizing well-parenthesized expressions in the streaming model. SIAM J. Comput. 43(6), 1880–1905 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Lewis II, P.M., Stearns, R.E., Hartmanis, J.: Memory bounds for recognition of context-free and context-sensitive languages. In: Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 191–202. IEEE Computer Society (1965)Google Scholar
  24. 24.
    Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315–323 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Segoufin, L., Sirangelo, C.: Constant-memory validation of streaming XML documents against DTDs. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 299–313. Springer, Heidelberg (2006). CrossRefGoogle Scholar
  26. 26.
    Segoufin, L., Vianu, V.: Validating streaming XML documents. In: Proceedings of PODS 2002, pp. 53–64. ACM (2002)Google Scholar
  27. 27.
    Stearns, R.E., Hartmanis, J., Lewis II, P.M.: Hierarchies of memory limited computations. In: Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 179–190. IEEE Computer Society (1965)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department für Elektrotechnik und InformatikUniversität SiegenSiegenGermany

Personalised recommendations