Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1997: Automata, Languages and Programming pp 154–165Cite as

Monadic simultaneous rigid E-unification and related problems

  • Session 2: Computability
  • Conference paper
  • First Online:

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

Abstract

We study the monadic case of a decision problem know as simultaneous rigid E-unification. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.

Partially supported by grants from NSF, ONR and the Faculty of Science and Technology of Uppsala University.

Supported by a TFR grant.

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. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 6, pages 243–309. North Holland, Amsterdam, 1990.

    Google Scholar 

  2. A. Degtyarev, Yu. Gurevich, and A. Voronkov. Herbrand's theorem and equational reasoning: Problems and solutions. In Bulletin of the European Association for Theoretical Computer Science, volume 60, page---October 1996. The “Logic in Computer Science” column.

    Google Scholar 

  3. A. Degtyarev, Yu. Gurevich, P. Narendran, M. Veanes, and A. Voronkov. The decidability of simultaneous rigid E-unification with one variable. UPMAIL Technical Report 139, Uppsala University, Computing Science Department, March 1997.

    Google Scholar 

  4. A. Degtyarev, Yu. Matiyasevich, and A. Voronkov. Simultaneous rigid E-unification and related algorithmic problems. In Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS'96), pages 494–502, New Brunswick, NJ, July 1996. IEEE Computer Society Press.

    Google Scholar 

  5. A. Degtyarev and A. Voronkov. The undecidability of simultaneous rigid E-unification. Theoretical Computer Science, 166(1–2):291–300, 1996.

    Article  Google Scholar 

  6. Yu. Gurevich and A. Voronkov. Monadic simultaneous rigid E-unification and related problems. UPMAIL Technical Report 137, Uppsala University, Computing Science Department, February 1997.

    Google Scholar 

  7. A. Koscielski and L. Pacholski. Complexity of unification in free groups and free semigroups. In Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, pages 824–829, Los Alamitos, 1990.

    Google Scholar 

  8. A. Koscielski and L. Pacholski. Complexity of Makanin's algorithm. Journal of the Association for Computing Machinery, 43(4):670–684, 1996.

    Google Scholar 

  9. D. Kozen. Complexity of finitely presented algebras. In Proc. of the 9th Annual Symposium on Theory of Computing, pages 164–177, New York, 1977. ACM.

    Google Scholar 

  10. D. Kozen. Lower bounds for natural proof systems. In Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS), pages 254–266, 1977.

    Google Scholar 

  11. G.S. Makanin. The problem of solvability of equations in free semigroups. Mat. Sbornik (in Russian), 103(2):147–236, 1977. English Translation in American Mathematical Soc. Translations (2), vol. 117, 1981.

    Google Scholar 

  12. D. Perrin. Finite automata. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 1, pages 1–57. Elsevier Science, Amsterdam, 1990.

    Google Scholar 

  13. D.A. Plaisted. Special cases and substitutes for rigid E-unification. Technical Report MPI-I-95-2-010, Max-Planck-Institut für Informatik, November 1995.

    Google Scholar 

  14. K.U. Schulz. Makanin's algorithm: Two improvements and a generalization. In K.U. Schulz, editor, Word Equations and Related Topics, volume 572 of Lecture Notes in Computer Science, Tübingen, Germany, October 1990.

    Google Scholar 

  15. R. Shostak. An algorithm for reasoning about equality. Communications of the ACM, 21:583–585, July 1978.

    Article  Google Scholar 

  16. M. Veanes. Uniform representation of recursively enumerable sets with simultaneous rigid E-unification. UPMAIL Technical Report 126, Uppsala University, Computing Science Department, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EECS Department, University of Michigan, 48109-2122, Ann Arbor, MI, USA

    Yuri Gurevich

  2. Computing Science Department, Uppsala University, Box 311, S-751 05, Uppsala, Sweden

    Andrei Voronkov

Authors
  1. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurevich, Y., Voronkov, A. (1997). Monadic simultaneous rigid E-unification and related problems. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_173

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_173

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation