Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1996: Algorithms and Computation pp 239–246Cite as

Bounded length UCFG equivalence

  • Session 6b: Invited Presentation
  • Conference paper
  • First Online:

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

Abstract

A randomised polylog time algorithm is given for deciding whether or not the sets of words of a given length generated by two unambiguous context-free grammars coincide. The algorithm is in randomised NC4 in terms of the product of the grammar size and the length.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Berkowitz. On computing the determinant in small parallel time using a small number of processors. Inf. Proc. Lett., 18:147–150, 1984.

    Article  Google Scholar 

  2. A. Bertoni, M. Goldwurm, and P. Massazza. Counting problems and algebraic formal power series in noncommuting variables. Inf. Proc. Lett., 34:117–121, 1990.

    Article  Google Scholar 

  3. Michael R. Garey and David S. Johnson. Computers and Intractability. W.H.Freeman and Company, New York, 1979.

    Google Scholar 

  4. J. Hopcroft and J. Ullman. Introduction to Automata Theory,Languages and Computation. Addison-Wesley, 1979.

    Google Scholar 

  5. D. Huynh. The complexity of ranking. In 3rd Structure in Complexity Theory Conf., pages 204–212, 1988.

    Google Scholar 

  6. D. Huynh. The complexity of deciding code and monoid properties for regular sets. Technical report, Computer science, U. Texas-Dallas, 1990.

    Google Scholar 

  7. D.T. Huynh. The complexity of ranking simple languages. Mathematical Systems Theory, 23:1–19, 1990.

    Article  Google Scholar 

  8. W. Kuich and A. Salomaa. Semirings, Automata, Languages. Springer-Verlag, 1986.

    Google Scholar 

  9. S. Lang. Algebra. Addison-Wesley, 1965.

    Google Scholar 

  10. B. Litow. Parallel complexity of the regular code problem. Inf. and Comp., 86, 1:107–114, 1990.

    Article  Google Scholar 

  11. B. Litow. Numbering unambiguous context-free languages. In 17th Australian Computer Society Conf., pages 373–378. University of Canterbury, New Zealand, 1994.

    Google Scholar 

  12. K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. In 19th Symp. on Theory of Computing (STOC), pages 345–354. ACM, 1987.

    Google Scholar 

  13. I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, James Cook University, Australia

    B. Litow

Authors
  1. B. Litow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Litow, B. (1996). Bounded length UCFG equivalence. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009500

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation