Learning of Regular Bi-omega Languages

Authors:
D. G. Thomas;M. Humrosia Begam;K. G. Subramanian;S. Gnanasekaran
Affiliations:
-;-;-;-
Venue:
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Year:
2002

Citing 9
Cited 2

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Algebraic languages

Theoretical Computer Science
Finitely generated bi &lgr;-languages

Theoretical Computer Science
Learning local and recognizable &ohgr;-languages and monadic logic programs

Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
Symbolic dynamics and finite automata

Handbook of formal languages, vol. 2
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
On Defect Effect of Bi-Infinite Words

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Inference of omega-Languages from Prefixes

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory

Inference of W-languages from prefixes

Theoretical Computer Science - Special issue: Algorithmic learning theory
Learning deterministic DEC grammars is learning rational numbers

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we define three classes of languages of biinfinite words, namelyl ocal bi-驴 languages, recognizable bi-驴 languages and B眉chi local bi-驴 languages as subclasses of the class of regular bi-驴 languages and prove some basic results. We observe that the class of recognizable bi-驴 languages coincides with the well-known class of rational bi-adherence languages and show that the class of regular bi-驴 languages is the class of morphic images of B眉chi local bi-驴 languages. We provide learning algorithms for B眉chi local bi-驴 languages and regular bi-驴 languages.