Skip to main content
Springer Nature Link
Log in

The Complexity of Learning SUBSEQ (A)

  • Conference paper
Algorithmic Learning Theory (ALT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4264))

Included in the following conference series:

  • 796 Accesses

Abstract

Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inference problem: given A(ε), A(0), A(1), A(00), ... learn, in the limit, a DFA for SUBSEQ(A). We consider this model of learning and the variants of it that are usually studied in inductive inference: anomalies, mindchanges, and teams.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baliga, G., Case, J.: Learning with higher order additional information. In: Proc. 5th Int. Workshop on Algorithmic Learning Theory, pp. 64–75. Springer, Heidelberg (1994)

    Google Scholar 

  2. Blum, L., Blum, M.: Towards a mathematical theory of inductive inference. Information and Computation 28, 125–155 (1975)

    MATH  MathSciNet  Google Scholar 

  3. Case, J., Jain, S., Manguelle, S.N.: Refinements of inductive inference by Popperian and reliable machines. Kybernetika 30(1), 23–52 (1994)

    MATH  MathSciNet  Google Scholar 

  4. Case, J., Smith, C.H.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 193–220 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Daley, R., Kalyanasundaram, B., Velauthapillai, M.: Breaking the probability 1/2 barrier in FIN-type learning. Journal of Computer and System Sciences 50, 574–599 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fenner, S., Gasarch, W., Postow, B.: The complexity of finding SUBSEQ(L) (unpublished manuscript, 2006)

    Google Scholar 

  7. Fortnow, L., Jain, S., Gasarch, W., Kinber, E., Kummer, M., Kurtz, S., Pleszkoch, M., Slaman, T., Stephan, F., Solovay, R.: Extremes in the degrees of inferability. Annals of Pure and Applied Logic 66, 21–276 (1994)

    Article  Google Scholar 

  8. Freivalds, R., Smith, C.H.: On the role of procrastination for machine learning. Information and Computation 107(2), 237–271 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Freivalds, R., Smith, C.H., Velauthapillai, M.: Trade-off among parameters affecting inductive inference. Information and Computation 82(3), 323–349 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gasarch, W., Kinber, E., Pleszkoch, M., Smith, C.H., Zeugmann, T.: Learning via queries, teams, and anomalies. Fundamenta Informaticae 23, 67–89 (1995); Prior version in Computational Learning Theory (COLT) (1990)

    Google Scholar 

  11. Gasarch, W., Lee, A.: Inferring answers to queries. In: Proceedings of 10th Annual ACM Conference on Computational Learning Theory, pp. 275–284 (1997); Long version on Gasarch’s home page, in progress, much expanded

    Google Scholar 

  12. Gasarch, W., Pleszkoch, M., Solovay, R.: Learning via queries to [ + , < ]. Journal of Symbolic Logic 57(1), 53–81 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gasarch, W., Pleszkoch, M., Stephan, F., Velauthapillai, M.: Classification using information. In: Annals of Math and AI, pp. 147–168 (1998); Earlier version in Proc. 5th Int. Workshop on Algorithmic Learning Theory, pp. 290–300 (1994)

    Google Scholar 

  14. Gasarch, W., Smith, C.H.: Learning via queries. Journal of the ACM 39(3), 649–675 (1988); Prior version in IEEE Sym. on Found. of Comp. Sci. (FOCS) (1988)

    Article  MathSciNet  Google Scholar 

  15. Gold, E.M.: Language identification in the limit. Information and Computation 10(10), 447–474 (1967)

    MATH  Google Scholar 

  16. Higman, A.G.: Ordering by divisibility in abstract algebra. Proc. of the London Math Society 3, 326–336 (1952)

    Article  MathSciNet  Google Scholar 

  17. Kummer, M., Stephan, F.: On the structure of the degrees of inferability. Journal of Computer and System Sciences 52(2), 214–238 (1996); Prior version in Sixth Annual Conference on Computational Learning Theory (COLT), 1993

    Article  MATH  MathSciNet  Google Scholar 

  18. Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967); Reprinted by MIT Press (1987)

    MATH  Google Scholar 

  19. Sacks, G.E.: Higher Recursion Theory. In: Perspectives in Mathematical Logic. Springer, Berlin (1990)

    Google Scholar 

  20. Soare, R.: Recursively Enumerable Sets and Degrees. In: Perspectives in Mathematical Logic. Springer, Berlin (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, University of South Carolina, SC, 29208, Columbia

    Stephen Fenner

  2. Dept. of Computer Science and UMIACS, University of Maryland at College Park, College Park, MD, 20742, USA

    William Gasarch

Authors
  1. Stephen Fenner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. William Gasarch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informàtics Laboratori d’Algorísmica Relacional, Complexitat i Aprenentatge, Universitat Politècnica de Catalunya, Barcelona,  

    José L. Balcázar

  2. Google, 1600 Amphitheatre Parkway, 94043, Mountain View, CA, USA

    Philip M. Long

  3. Department of Computer Science and Department of Mathematics, National University of Singapore, 117543, Singapore, Republic of Singapore

    Frank Stephan

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fenner, S., Gasarch, W. (2006). The Complexity of Learning SUBSEQ (A). In: Balcázar, J.L., Long, P.M., Stephan, F. (eds) Algorithmic Learning Theory. ALT 2006. Lecture Notes in Computer Science(), vol 4264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11894841_12

Download citation

  • DOI: https://doi.org/10.1007/11894841_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46649-9

  • Online ISBN: 978-3-540-46650-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics