Skip to main content
Springer Nature Link
Log in

Learning ω-regular languages from queries and counter-examples (a preliminary report)

  • Submitted Papers
  • Conference paper
  • First Online:
Analogical and Inductive Inference (AII 1989)

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

Included in the following conference series:

  • 201 Accesses

Abstract

In this paper we discuss problems concerning the learnability of ω-regular languages from examples via the synthesis of their corresponding finite-state acceptors. The main technical contribution of this paper is a polynomial algortihm that learns a sub-class of the ω-regular languages from queries and counter-examples. A similar setting has been suggested in [Ang87] for learning (finitary) regular languages. The algorithm given there produces the minimal automaton accepting the desired language using polynomially many (in the number of states) queries and computation steps. Our algorithm tackles some special problems that arise when adapting this framework to the infinitary case.

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. D. Angluin, A Note on the Number of Queries Needed to Identify Regular Languages, Information and Control 51, 76–87, 1981.

    Google Scholar 

  2. D. Angluin, Learing Regular Sets from Queries and Counter-Examples, Information and Computation 75, 87–106, 1987.

    Google Scholar 

  3. A. Arnold, A Syntactic Congruence for Rational ω-Languages, Theoretical Computer Science 39, 333–335, 1985.

    Google Scholar 

  4. A.W. Biermann and J.A. Feldman, On the Synthesis of Finite-State Machines from Samples of their Behavior, IEEE Trans. on Computers C-21, 592–597, 1972.

    Google Scholar 

  5. Y. Choueka, Theories of Automata on ω-Tapes: A Simplified Approach. J. of Computer and System Sciences 8, 117–141, 1974.

    Google Scholar 

  6. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New-York, 1974.

    Google Scholar 

  7. E.M. Gold, System Identification via State Characterization, Automatica 8, 621–636, 1972.

    Google Scholar 

  8. D. Harel and A. Pnueli, On the Development of Reactive Systems, in K.R. Apt (Ed.), Logics and Models of Concurrent Systems, 123–144, Springer, Berlin, 1985.

    Google Scholar 

  9. H.J. Hoogeboom and G. Rozenberg, Infinitary Languages — Basic Theory and Applications to Concurrent Systems, in J.W. de-Bakker et al. (Eds.), Current Trends in Concurrency, 266–342, LNCS 244, Springer, Berlin, 1985.

    Google Scholar 

  10. P. Johansen, Inductive Inference of Ultimately Periodic Sequences, BIT 28, 537–580, 1988.

    Google Scholar 

  11. M. Kaminski, A Classification of ω-Regular Languages, Theoretical Computer Science 36, 217–229, 1985.

    Google Scholar 

  12. L.H. Landweber, Decision Problems for ω-Automata, Mathematical Systems Theory 3, 376–384, 1969.

    Google Scholar 

  13. O. Maler, Detecting Regularities in Computations, Unpublished Ph.D. Proposal, Weizmann Institute, Rehovot, 1987.

    Google Scholar 

  14. Z. Manna and A. Pnueli, A. Hierarchy of Temporal Properties, TR-CS-88-08, Weizmann Institute, Rehovot, 1988.

    Google Scholar 

  15. D.E. Moore, Gedanken Experiments on Sequential Machines, in: Shannon and McCarthy (Eds.), Automata Studies, 129–153, Princeton University Press, Princeton, 1956.

    Google Scholar 

  16. D. Perrin, An Introduction to Finite Automata on Infinite words, in D. Perrin (Ed.), Automata on Infinite Words, 2–17, LNCS 192, Springer, Berlin, 1985.

    Google Scholar 

  17. R.L. Rivest and R.E. Schapire, Diversity-Based Inference of Finite Automata, Proceedings of the 28th ACM Symposium on Foundations of Computer Science, 78–87, 1987.

    Google Scholar 

  18. L. Staiger, Finite-State ω-Languages, J. of Computer and System Sciences 27, 434–448, 1983.

    Google Scholar 

  19. L. Staiger, Research in the Theory of ω-languages, J. Inf. Process. Cybern. EIK 23, 415–439, 1987.

    Google Scholar 

  20. W. Thomas, Automata on Infinite Objects, Report 88-17, RWTH Aachen, 1988.

    Google Scholar 

  21. B.A. Trakhtenbrot and Y.M. Barzdin, Finite Automata: Behavior and Synthesis, North-Holland, Amsterdam, 1973.

    Google Scholar 

  22. J. Ulehla, Over the Draft of Detecting Regularities in Computations, Report 88-78, Charles University, Prague, 1988.

    Google Scholar 

  23. M.Y. Vardi and P. Wolper, Automata-Theoretic Techniques for Modal Logics of Programs, J. of Computer and Systems Science 32, 183–221, 1986.

    Google Scholar 

  24. K. Wagner, On ω-Regular Sets, Information and Control 43, 123–177, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Weizmann Institute of Science, 76100, Rehovot, Israel

    Oded Maler & Amir Pnueli

Authors
  1. Oded Maler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maler, O., Pnueli, A. (1989). Learning ω-regular languages from queries and counter-examples (a preliminary report). In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1989. Lecture Notes in Computer Science, vol 397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51734-0_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-51734-0_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51734-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics