Advertisement

Pusdown space complexity and related full-A.F.L.s.

  • J. Gabarro
Contibuted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)

Abstract

We study space contraints in p.d.a.'s.We call pushd0own complexity of a language the space needed by a p.d.a. to accept that language.

We prove that every deterministic language has a linear lower bound in pushdown complexity.

We study sublinear bounds.In particular we construct languages with pusdown complexity strictly in n1/q or log n.

We prove that the family of languages with sublinear complexity is a full-A.F.L. containing one infinite decreasing chain of full-A.F.L's.

Keywords

Complexity Measure Linear Complexity Regular Language Infinite Chain Formal Language Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Autebert, J;Beauquier,J;Boasson,L;Latteux,M. [1980] "Very small families of algebraic non rational languages" in Formal Language Theory, editor Book,R,Academic Press.Google Scholar
  2. [2]
    Boasson, L.;Courcelle, B.;Nivat, M. [1981]. "The rational index a complexity measure for languages". SIAM Journal on Computing 10,2,284–296.Google Scholar
  3. [3]
    Culik,K;Maurer,H. "On the derivation of trees". Internal repport.Google Scholar
  4. [4]
    Gabarro,J. [1983]. "Funciones de complejidad y su relacion con las familias abstractas de lenguages". Thesis.Universidad Politécnica de Barcelona.Spain.Google Scholar
  5. [5]
    Gabarro,J. [1983]. "Initial index:a new complexity function for languages". ICALP-83.Lec.not.comp.sci.154,pag 226–236.Google Scholar
  6. [6]
    Ginsburg, S;Greibach, S. [1969]. "Abstract families of languages" in Abstract families of languages.Mem. of the Amer. Math.Soc.87,1–32.Google Scholar
  7. [7]
    Goldstine, J. [1972]. "Substitution and bounded languages". J.Comp.Syst.Sci.6,9–29.Google Scholar
  8. [8]
    Lewis,P;Hartmanis,J;Stearns,R. [1965]. "Memory bounds for the recognition of context-free and context-sensitive languages". IEEE.Conf.Record on Switching Circuit Theory and Logical Dessign, 179–202.Google Scholar
  9. [9]
    Nivat, M. [1968]. "Transductions des langages de Chomsky". Ann.de l'Inst.Fourier 18,339–456.Google Scholar
  10. [10]
    Stearns, R. [1967]. "A regularity test for pushdown-machines". Inf;and Control 11,323–340.Google Scholar
  11. [11]
    Valiand, L. [1976]. "A note on the succincstness of description of deterministic languages". Inf.and Control 32, 139–145.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • J. Gabarro
    • 1
  1. 1.Facultat d'InformàticaUniversitat Politècnica de BarcelonaBarcelona(34)Spain

Personalised recommendations