Skip to main content
Conference Proceedings

Towards decidability of conjugacy of pairs and triples

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5378 LNAI 224-231
DOI: 10.1007/978-3-540-92701-3_16
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The equation XZ∈=∈ZY is called the conjugacy equation. Here X, Y and Z are languages over a finite alphabet. Given two sets X and Y, we can ask "Does there exist a Z which makes the conjugacy equation true?". We answer this question partially in the case when one of them is a two element set and the other is a three element set. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kenkireth, B. G., & Ram, S. (2009). Towards decidability of conjugacy of pairs and triples. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5378 LNAI, pp. 224–231). https://doi.org/10.1007/978-3-540-92701-3_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free