Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2001: Fundamentals of Computation Theory pp 172–183Cite as

Prediction-Preserving Reducibility with Membership Queries on Formal Languages

  • Conference paper
  • First Online:

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

Abstract

This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular pattern languages. For the former, we mainly show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, we show that both bounded finite unions of regular pattern languages and unbounded finite unions of substring pattern languages are pwm-reducible to DFAs.

This work is partially supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research (B) nos. 11558040, 13558029 and 13558036, and Grant-in-Aid for Encouragement of Young Scientists no. 12780233.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, M. J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM 18(6) (1975), 333–340.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Angluin, Finding patterns common to a set of strings, J. Comput. System Sci. 21(1) (1980) 46–62.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Angluin, Learning regular sets from queries and counterexamples, Inform. Comput. 75(2) (1987) 87–106.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Angluin, Learning k-bounded context-free grammars, Technical Report YALEU/DCS/RR-557, Yale University, 1987.

    Google Scholar 

  5. D. Angluin, Queries and concept learning, Mach. Learn. 2(4) (1988) 319–342.

    Google Scholar 

  6. D. Angluin, M. Kharitonov, When won’t membership queries help?, J. Comput. System Sci. 50(2) (1995) 336–355.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Ginsburg, The mathematical theory of context free languages (McGraw-Hill, 1966).

    Google Scholar 

  8. M. A. Harrison, Introduction to formal language theory (Addison-Wesley, 1978).

    Google Scholar 

  9. J. E. Hopcroft, J. D. Ullman, Introduction to automata theory, languages and computation (Addison-Wesley, 1979).

    Google Scholar 

  10. H. Ishizaka, Polynomial time learnability of simple deterministic languages, Mach. Learn. 5(2) (1990) 151–164.

    Google Scholar 

  11. M. Kearns, L. Pitt, A polynomial-time algorithm for learning k-variable pattern languages from examples, in: Proc. 2nd Ann. Conf. on Computational Learning Theory (ACM, 1989) 57–71.

    Google Scholar 

  12. M. Kearns, L. Valiant, Cryptographic limitations on learning Boolean formulae and finite automata, J. ACM 41(1) (1994) 67–95.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Marron, Identification of pattern languages from examples and queries, Inform. Comput. 74(2) (1987) 91–112.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Marron, Learning pattern languages from a single initial example and from queries, in: Proc. 1st Ann. Workshop on Computational Learning Theory (ACM, 1988) 345–358.

    Google Scholar 

  15. S. Matsumoto, A. Shinohara, Learning pattern languages using queries, in: Proc. 3rd Euro. Conf. on Computational Learning Theory, LNAI 1208 (Springer, 1997) 185–197.

    Google Scholar 

  16. R. McNaughton, Parenthesis grammars, J. ACM 14(3) (1967) 490–500.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Nessel, S. Lange, Learning erasing pattern languages with queries, in: Proc. 11th Internat. Conf. on Algorithmic Learning Theory, LNAI 1968 (Springer, 2000) 86–100.

    Google Scholar 

  18. L. Pitt, M. K. Warmuth, Prediction-preserving reduction, J. Comput. System Sci. 41(3) (1990) 430–467.

    Article  MATH  MathSciNet  Google Scholar 

  19. Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, Theor. Comput. Sci. 76(2–3) (1990) 223–242.

    Article  MATH  MathSciNet  Google Scholar 

  20. Y. Sakakibara, On learning Smullyan’s elementary formal systems: Towards an efficient learning method for context-sensitive languages, Adv. Soft. Sci. Tech. 2 (1990) 79–101.

    Google Scholar 

  21. H. Sakamoto, Language learning from membership queries and characteristic examples, in: Proc. 6th Internat. Workshop on Algorithmic Learning Theory, LNAI 997 (Springer, 1995) 55–65.

    Google Scholar 

  22. H. Sakamoto, K. Hirata, H. Arimura, Learning elementary formal systems with queries, Technical Report DOI-TR-179, Department of Informatics, Kyushu University, 2000. Also available at http://www.i.kyushu-u.ac.jp/doi-tr.html.

  23. N. Sugimoto, T. Toyoshima, S. Shimozono, K. Hirata, Constructive learning of context-free languages with a subpansive tree, in: Proc. 5th Internat. Colloq. on Grammatical Inference, LNAI 1891 (Springer, 2000) 270–283.

    Google Scholar 

  24. E. Shamir, On sequential languages and two classes of regular events, Zeit. Phone., Sprach. und Kommun. 18 (1965) 61–69.

    MathSciNet  Google Scholar 

  25. T. Shinohara, Polynomial time inference of extended regular pattern languages, in: Proc. RIMS Symposia on Software Science and Engineering, LNCS 147 (Springer, 1982) 115–127.

    Google Scholar 

  26. T. Shinohara, H. Arimura, Inductive inference of unbounded unions of pattern languages from positive data, Theor. Comput. Sci. 241 (2000) 191–209.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan

    Kouichi Hirata

  2. Department of Informatics, Kyushu University, Hakozaki 6-10-1, Fukuoka, 812-8581, Japan

    Hiroshi Sakamoto

Authors
  1. Kouichi Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Sakamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirata, K., Sakamoto, H. (2001). Prediction-Preserving Reducibility with Membership Queries on Formal Languages. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation