Skip to main content
SpringerLink
Log in

Characterizing unambiguous augmented pushdown automata by circuits

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

Abstract

The notions of weak and strong unambiguity of augmented push-down automata are considered and related to unambiguities of circuits. In particular we exhibit circuit classes exactly characterizing polynomially time bounded unambiguous augmented push-down automata.

This research was partially supported by the Deutsche Forschungsgemeinschaft, SFB 324

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. A. K. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J. ACM, 28:114–133, 1981.

    Google Scholar 

  2. S. A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. J. ACM, 18:4–18, 1971.

    Google Scholar 

  3. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inform. and Control, 64:2–22, 1985.

    Google Scholar 

  4. P. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th ICALP, number 226 in LNCS, pages 95–104. Springer, 1987.

    Google Scholar 

  5. K.-J. Lange. Unambiguity of circuits. To appear in Proc. of Structure in Complexity Conf., 1990.

    Google Scholar 

  6. W. L. Ruzzo. On uniform circuit complexity. J. Comput. Syst. Sci., 22:365–338, 1981.

    Google Scholar 

  7. W. L. Ruzzo. Tree-size bounded alternation. J. Comput. Syst. Sci., 21:218–235, 1980.

    Google Scholar 

  8. W. Rytter. Parallel time O(log n) recognition of unambiguous context-free languages. Inform. and Comp., 73:75–86, 1987.

    Google Scholar 

  9. L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2):409–422, May 1984.

    Google Scholar 

  10. H. Venkateswaran. Properties that characterize LOGCFL. In Proc. of 19th STOC, pages 141–150, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr. 21, D-8000, München 2

    Klaus-Jörn Lange & Peter Rossmanith

Authors
  1. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Rossmanith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, KJ., Rossmanith, P. (1990). Characterizing unambiguous augmented pushdown automata by circuits. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029635

Download citation

  • DOI: https://doi.org/10.1007/BFb0029635

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation