External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Satisfiability of Word Equations: Decidable and Undecidable Theories

Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka. The Satisfiability of Word Equations: Decidable and Undecidable Theories. In Igor Potapov, Pierre-Alain Reynier, editors, Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings. Volume 11123 of Lecture Notes in Computer Science, pages 15-29, Springer, 2018. [doi]

Authors

Joel D. Day

This author has not been identified. Look up 'Joel D. Day' in Google

Vijay Ganesh

This author has not been identified. Look up 'Vijay Ganesh' in Google

Paul He

This author has not been identified. Look up 'Paul He' in Google

Florin Manea

This author has not been identified. Look up 'Florin Manea' in Google

Dirk Nowotka

This author has not been identified. Look up 'Dirk Nowotka' in Google
runs on