Skip to main content
SpringerLink
Log in

Representing complexity classes by equality sets

Preliminary report

  • Conference paper
  • First Online:
Book cover 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:

This research was supported in part by the National Science Foundation under Grant MCS77-11360. The work of the second author was also supported by the German Academic Exchange Service under Grant No. 430/402/777/9.

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. R. Book, Polynomial space and transitive closure, SIAM J. Computing, to appear.

    Google Scholar 

  2. K. Culik II, A purely homomorphic characterization of recursively enumerable sets, J. Assoc. Comput. Mach., to appear.

    Google Scholar 

  3. K. Culik II, On homomorphic characterization of families of languages, unpublished manuscript.

    Google Scholar 

  4. K. Culik II and H.A. Maurer, On simple representations of language families, RAIRO — Informatique Theorique, to appear.

    Google Scholar 

  5. J. Engelfriet and G. Rozenberg, Fixed point languages, equality languages, and representation of recursively enumerable languages, J. Assoc. Comput. Mach., to appear. An extended abstract appears in the Proceedings of the 19th IEEE Symposium on Foundations of Computer Science (1978), 123–126.

    Google Scholar 

  6. J. Hopcroft and J. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  7. A. Salomaa, Equality sets for homomorphisms of free monoids, Acta Cybernetica, to appear.

    Google Scholar 

  8. R. Smullyan, Theory of Formal Systems, Annals of Mathematics Studies, No. 47, Princeton University Press, 1961.

    Google Scholar 

  9. R. Stearns, J. Hartmanis and P. Lewis, Hierarchies for memory limited computations, Conference Record 6th IEEE Symp. on Switching Circuit Theory and Logical Design (1965), 179–190.

    Google Scholar 

  10. C. Wrathall, Remarks on languages and relations, in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California at Santa Barbara, 93106, Santa Barbara, Ca., USA

    Ronald V. Book & Franz-Josef Brandenburg

Authors
  1. Ronald V. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franz-Josef Brandenburg
    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

Book, R.V., Brandenburg, FJ. (1979). Representing complexity classes by equality sets. 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_5

Download citation

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

  • 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