Skip to main content
SpringerLink
Log in

On the succinctness of different representations of languages

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 71))

Included in the following conference series:

Abstract

The purpose of this paper is to give simple new proofs of some interesting recent results about the relative succinctness of different representations of regular, deterministic and unambiguous context-free languages and to derive some new results about how the relative succinctness of representations change when the representations contain a formal proof that the languages generated are in the desired subclass of languages.

This research has been supported in part by National Science Foundation Grants DCR75-09433 and MCS 78-00418.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, M. "On the Size of Machines", Information and Control, Vol. 11 (1967), 257–265.

    Google Scholar 

  2. Hartmanis, J. "Context-Free Languages and Turing Machine Computations", Proceedings of Symposia in Applied Mathematics, Vol. 19, Mathematical Aspects of Computer Science, pp. 42–51, Amer. Math. Soc. 1967.

    Google Scholar 

  3. Meyer, A.R. and M.J. Fischer. "Economy of Description by Automata, Grammars and Formal Systems", Conference Record, IEEE 12th Annual Symposium on Switching and Automata Theory (1971), 188–190.

    Google Scholar 

  4. Reedy, H. and W.J. Savitch. "The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages", Theoretical Computer Science, Vol. 1 (1975), 77–91.

    Google Scholar 

  5. Schmidt, E.H. and T.G. Szymanski. "Succinctness of Descriptions of Unambiguous Context-Free Languages", SIAM J. Computing, Vol. 6 (1977), 547–553.

    Google Scholar 

  6. Valiant, L.G. "A Note on the Succinctness of Descriptions of Deterministic Languages", Information and Control, Vol. 32 (1976), 139–145.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853, Ithaca, NY

    J. Hartmanis

Authors
  1. J. Hartmanis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmanis, J. (1979). On the succinctness of different representations of languages. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation