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.
References
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.
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.
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.
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.
A. Degtyarev and A. Voronkov. The undecidability of simultaneous rigid E-unification. Theoretical Computer Science, 166(1–2):291–300, 1996.
Yu. Gurevich and A. Voronkov. Monadic simultaneous rigid E-unification and related problems. UPMAIL Technical Report 137, Uppsala University, Computing Science Department, February 1997.
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.
A. Koscielski and L. Pacholski. Complexity of Makanin's algorithm. Journal of the Association for Computing Machinery, 43(4):670–684, 1996.
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.
D. Kozen. Lower bounds for natural proof systems. In Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS), pages 254–266, 1977.
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.
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.
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.
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.
R. Shostak. An algorithm for reasoning about equality. Communications of the ACM, 21:583–585, July 1978.
M. Veanes. Uniform representation of recursively enumerable sets with simultaneous rigid E-unification. UPMAIL Technical Report 126, Uppsala University, Computing Science Department, 1996.
Author information
Authors and Affiliations
Editor information
Rights 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