Author:
Cano Antonio,García Pedro
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Shinohara, T., Arimura, H.: Inductive inference of unbounded unions of pattern languages from positive data. Theoretical Computer Science 241, 191–209 (2000)
2. Pin, J.E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems 30, 1–38 (1997)
3. Angluin, D.: Finding common patterns to a set of strings. In: Proc. 11th Ann. Symp. Theory of Computing, pp. 130–141 (1979)
4. Arikawa, S., Kuhara, S., Miyano, S., Shinohara, A., Shinohara, T.: A learning algorithm for elementary formal systems and its experiments on identification of trandmembrane domains. In: Proc. 25th Hawaii Int. Conf. on System Science, vol. 1, pp. 675–684 (1992)
5. Pin, J.E., Weil, P.: The wreath product principle for ordered semigroups. Communications in Algebra 30, 5677–5713 (2002)