Skip to main content
SpringerLink
Log in

A Discontinuity in Pattern Inference

  • Conference paper
STACS 2004 (STACS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2996))

Included in the following conference series:

Abstract

This paper examines the learnability of a major subclass of E-pattern languages – also known as erasing or extended pattern languages – in Gold’s learning model: We show that the class of terminal-free E-pattern languages is inferrable from positive data if the corresponding terminal alphabet consists of three or more letters. Consequently, the recently presented negative result for binary alphabets is unique.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D.: Finding patterns common to a set of strings. In: Proc. STOC 1979, pp. 130–141 (1979)

    Google Scholar 

  2. Angluin, D.: Inductive inference of formal languages from positive data. Inf. Control 45, 117–135 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Filè, G.: The relation of two patterns with comparable language. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 184–192. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  4. Gold, E.M.: Language identification in the limit. Inf. Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  5. Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. Int. J. Comput. Math. 50, 147–163 (1994)

    Article  MATH  Google Scholar 

  6. Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. J. Comput. Syst. Sci. 50, 53–63 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lange, S., Wiehagen, R.: Polynomial-time inference of arbitrary pattern languages. New Generat. Comput. 8, 361–370 (1991)

    Article  MATH  Google Scholar 

  8. Lipponen, M., Păun, G.: Strongly prime PCP words. Discrete Appl. Math. 63, 193–197 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mateescu, A., Salomaa, A.: PCP-prime words and primality types. RAIRO Inform. théor. 27(1), 57–70 (1993)

    MATH  MathSciNet  Google Scholar 

  10. Mateescu, A., Salomaa, A.: Finite degrees of ambiguity in pattern languages. RAIRO Inform. théor. 28(3-4), 233–253 (1994)

    MATH  MathSciNet  Google Scholar 

  11. Mitchell, A.R.: Learnability of a subclass of extended pattern languages. In: Proc. COLT 1998, pp. 64–71 (1998)

    Google Scholar 

  12. Reidenbach, D.: A non-learnable class of E-pattern languages. Theor. Comp. Sci. (to appear)

    Google Scholar 

  13. Reidenbach, D.: A negative result on inductive inference of extended pattern languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 308–320. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Reischuk, R., Zeugmann, T.: Learning one-variable pattern languages in linear average time. In: Proc. COLT 1998, pp. 198–208 (1998)

    Google Scholar 

  15. Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1992) (3rd print)

    Google Scholar 

  16. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)

    MATH  Google Scholar 

  17. Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol. 147, pp. 115–127. Springer, Heidelberg (1983)

    Google Scholar 

  18. Thue, A.: Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl. 7 (1906)

    Google Scholar 

  19. Wiehagen, R., Zeugmann, T.: Ignoring data be the only way to learn efficiently. J. Exp. Theor. Artif. Intell. 6, 131–144 (1994)

    Article  MATH  Google Scholar 

  20. Wright, K.: Identification of unions of languages drawn from an identifiable class. In: Proc. COLT 1989, pp. 328–333 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Technische Universität Kaiserslautern, Postfach 3049, 67653, Kaiserslautern, Germany

    Daniel Reidenbach

Authors
  1. Daniel Reidenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Stuttgart, FMI, Germany

    Volker Diekert

  2. LIAFA and the University of Paris 7, Denis Diderot,  

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reidenbach, D. (2004). A Discontinuity in Pattern Inference. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24749-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21236-2

  • Online ISBN: 978-3-540-24749-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation