Thue Systems and DNA - A Learning Algorithm for a Subclass
Abstract
Thue systems are considered to be appropriate for modeling certain kinds of behavior in DNA sequences [6]. We present a polynomial time algorithm for learning a Church-Rosser Thue system when the quotient monoid is finite, making use of membership queries related to the congruential languages, which specify regular languages.
Cite
Text
Siromoney et al. "Thue Systems and DNA - A Learning Algorithm for a Subclass." International Conference on Algorithmic Learning Theory, 1993. doi:10.1007/3-540-57370-4_57Markdown
[Siromoney et al. "Thue Systems and DNA - A Learning Algorithm for a Subclass." International Conference on Algorithmic Learning Theory, 1993.](https://mlanthology.org/alt/1993/siromoney1993alt-thue/) doi:10.1007/3-540-57370-4_57BibTeX
@inproceedings{siromoney1993alt-thue,
title = {{Thue Systems and DNA - A Learning Algorithm for a Subclass}},
author = {Siromoney, Rani and Thomas, D. Gnanaraj and Subramanian, K. G. and Dare, V. Rajkumar},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1993},
pages = {314-327},
doi = {10.1007/3-540-57370-4_57},
url = {https://mlanthology.org/alt/1993/siromoney1993alt-thue/}
}