Skip to main content
SpringerLink
Log in

The Online Space Complexity of Probabilistic Languages

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9537))

Included in the following conference series:

  • 581 Accesses

Abstract

In this paper, we define the online space complexity of languages, as the size of the smallest abstract machine processing words sequentially and able to determine at every point whether the word read so far belongs to the language or not. The first part of this paper motivates this model and provides examples and preliminary results.

One source of inspiration for introducing the online space complexity of languages comes from a seminal paper of Rabin from 1963, introducing probabilistic automata, which suggests studying the online space complexity of probabilistic languages. This is the purpose of the second part of the current paper.

Work supported by the ANR STOCH-MC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC 1996, pp. 20–29 (1996). http://doi.acm.org/10.1145/237814.237823

  2. Fijalkow, N., Skrzypczak, M.: Irregular behaviours for probabilistic automata. In: RP 2015, pp. 33–36 (2015)

    Google Scholar 

  3. Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182–209 (1985). http://dx.doi.org/10.1016/0022-0000(85)90041-8

    Article  MathSciNet  MATH  Google Scholar 

  4. Karp, R.M.: On-line algorithms versus off-line algorithms: how much is it worth to know the future? In: IFIP 1992, pp. 416–429 (1992)

    Google Scholar 

  5. Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315–323 (1980). http://dx.doi.org/10.1016/0304-3975(80)90061-4

    Article  MathSciNet  MATH  Google Scholar 

  6. Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. In: PODS 1994, pp. 210–221 (1994). http://doi.acm.org/10.1145/182591.182614

  7. Rabin, M.O.: Probabilistic automata. Inf. Control 6(3), 230–245 (1963). http://dx.doi.org/10.1016/S0019-9958(63)90290-0

    Article  MathSciNet  MATH  Google Scholar 

  8. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985). http://doi.acm.org/10.1145/2786.2793

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris Diderot - Paris 7, Paris, France

    Nathanaël Fijalkow

  2. University of Warsaw, Warsaw, Poland

    Nathanaël Fijalkow

  3. University of Oxford, Oxford, UK

    Nathanaël Fijalkow

Authors
  1. Nathanaël Fijalkow
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nathanaël Fijalkow .

Editor information

Editors and Affiliations

  1. City University of New York , New York, New York, USA

    Sergei Artemov

  2. Cornell University , Ithaca, New York, USA

    Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Fijalkow, N. (2016). The Online Space Complexity of Probabilistic Languages. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2016. Lecture Notes in Computer Science(), vol 9537. Springer, Cham. https://doi.org/10.1007/978-3-319-27683-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27683-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27682-3

  • Online ISBN: 978-3-319-27683-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation