Abstract
We provide an algorithm for learning an unknown regular set of infinite words, using membership and equivalence queries. Three variations of the algorithm learn three different canonical representations of omega regular languages, using the notion of families of dfas. One is of size similar to L $, a dfa representation recently learned using L* [7]. The second is based on the syntactic forc, introduced in [14]. The third is introduced herein.We show that the second can be exponentially smaller than the first, and the third is at most as large as the first two, with up to a quadratic saving with respect to the second.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Cerný, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for Java classes. In: POPL, pp. 98–109 (2005)
Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
Arnold, A.: A syntactic congruence for rational omega-languages. Theor. Comput. Sci. 39, 333–335 (1985)
Calbrix, H., Nivat, M., Podelski, A.: Ultimately periodic words of rational w-languages. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 554–566. Springer, Heidelberg (1994)
Cobleigh, J.M., Giannakopoulou, D., Păsăreanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331–346. Springer, Heidelberg (2003)
de la Higuera, C., Janodet, J.-.C.: Inference of [omega]-languages from prefixes. Theor. Comput. Sci. 313(2), 295–312 (2004)
Farzan, A., Chen, Y.-F., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Extending automated compositional verification to the full class of omega-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 2–17. Springer, Heidelberg (2008)
Jayasrirani, M., Humrosia Begam, M., Thomas, D.G., Emerald, J.D.: Learning of bi-languages from factors. Machine Learning Research Jour. 21, 139–144 (2012)
Jürgensen, H., Thierrin, G.: On-languages whose syntactic monoid is trivial. International Journal of Parallel Programming 12(5), 359–365 (1983)
Klarlund, N.: A homomorphism concept for omega-regularity. In: 8th Inter. Conf. on Computer Science Logic (CSL), pp. 471–485 (1994)
Leucker, M.: Learning meets verification. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol. 4709, pp. 127–151. Springer, Heidelberg (2007)
Lindner, R., Staiger, L.: Eine Bemerkung über nichtkonstantenfreie sequentielle operatoren. Elektronische Informationsverarbeitung und Kybernetik 10(4), 195–202 (1974)
Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316–326 (1995)
Maler, O., Staiger, L.: On syntactic congruences for omega-languages. Theor. Comput. Sci. 183(1), 93–112 (1997)
McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521–530 (1966)
Michel, M.: Complementation is much more difficult with automata on infinite words. In: Manuscript, CNET (1988)
Nam, W., Madhusudan, P., Alur, R.: Automatic symbolic compositional verification by learning assumptions. FMSD 32(3), 207–234 (2008)
Pfleeger, C.F.: State reduction in incompletely specified finite-state machines. IEEE Transactions on Computers 22(12), 1099–1102 (1973)
Saoudi, A., Yokomori, T.: Learning local and recognizable omega-languages and monadic logic programs. In: EUROCOLT. LNCS, vol. 1121, pp. 50–59. Springer (1993)
Staiger, L.: Finite-state omega-languages. J. Comput. Syst. Sci. 27(3), 434–448 (1983)
Trakhtenbrot, B.: Finite automata and monadic second order logic. Siberian Math. J., 103–131 (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Angluin, D., Fisman, D. (2014). Learning Regular Omega Languages. In: Auer, P., Clark, A., Zeugmann, T., Zilles, S. (eds) Algorithmic Learning Theory. ALT 2014. Lecture Notes in Computer Science(), vol 8776. Springer, Cham. https://doi.org/10.1007/978-3-319-11662-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-11662-4_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11661-7
Online ISBN: 978-3-319-11662-4
eBook Packages: Computer ScienceComputer Science (R0)