Learning of Bi-$\omega$ Languages from Factors

M. Jayasrirani, M. H. Begam, D. G. Thomas, J. D. Emerald
Proceedings of the Eleventh International Conference on Grammatical Inference, PMLR 21:139-144, 2012.

Abstract

Higuera and Janodet (2001) gave a polynomial algorithm that identifies the class of safe $\omega$-languages which is a subclass of deterministic $\omega$-languages from positive and negative prefixes. As an extension of this work we study the learning of the family of bi-$\omega$ languages.

Cite this Paper

BibTeX
@InProceedings{pmlr-v21-jayasri12a, title = {Learning of Bi-$\omega$ Languages from Factors}, author = {Jayasrirani, M. and Begam, M. H. and Thomas, D. G. and Emerald, J. D.}, booktitle = {Proceedings of the Eleventh International Conference on Grammatical Inference}, pages = {139--144}, year = {2012}, editor = {Heinz, Jeffrey and Higuera, Colin and Oates, Tim}, volume = {21}, series = {Proceedings of Machine Learning Research}, address = {University of Maryland, College Park, MD, USA}, month = {05--08 Sep}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v21/jayasri12a/jayasri12a.pdf}, url = {https://proceedings.mlr.press/v21/jayasri12a.html}, abstract = {Higuera and Janodet (2001) gave a polynomial algorithm that identifies the class of safe $\omega$-languages which is a subclass of deterministic $\omega$-languages from positive and negative prefixes. As an extension of this work we study the learning of the family of bi-$\omega$ languages.} }
Endnote
%0 Conference Paper %T Learning of Bi-$\omega$ Languages from Factors %A M. Jayasrirani %A M. H. Begam %A D. G. Thomas %A J. D. Emerald %B Proceedings of the Eleventh International Conference on Grammatical Inference %C Proceedings of Machine Learning Research %D 2012 %E Jeffrey Heinz %E Colin Higuera %E Tim Oates %F pmlr-v21-jayasri12a %I PMLR %P 139--144 %U https://proceedings.mlr.press/v21/jayasri12a.html %V 21 %X Higuera and Janodet (2001) gave a polynomial algorithm that identifies the class of safe $\omega$-languages which is a subclass of deterministic $\omega$-languages from positive and negative prefixes. As an extension of this work we study the learning of the family of bi-$\omega$ languages.
RIS
TY - CPAPER TI - Learning of Bi-$\omega$ Languages from Factors AU - M. Jayasrirani AU - M. H. Begam AU - D. G. Thomas AU - J. D. Emerald BT - Proceedings of the Eleventh International Conference on Grammatical Inference DA - 2012/08/16 ED - Jeffrey Heinz ED - Colin Higuera ED - Tim Oates ID - pmlr-v21-jayasri12a PB - PMLR DP - Proceedings of Machine Learning Research VL - 21 SP - 139 EP - 144 L1 - http://proceedings.mlr.press/v21/jayasri12a/jayasri12a.pdf UR - https://proceedings.mlr.press/v21/jayasri12a.html AB - Higuera and Janodet (2001) gave a polynomial algorithm that identifies the class of safe $\omega$-languages which is a subclass of deterministic $\omega$-languages from positive and negative prefixes. As an extension of this work we study the learning of the family of bi-$\omega$ languages. ER -
APA
Jayasrirani, M., Begam, M.H., Thomas, D.G. & Emerald, J.D.. (2012). Learning of Bi-$\omega$ Languages from Factors. Proceedings of the Eleventh International Conference on Grammatical Inference, in Proceedings of Machine Learning Research 21:139-144 Available from https://proceedings.mlr.press/v21/jayasri12a.html.

Related Material