Synthesis of Supervisors Using Learning Algorithm of RegularLanguages
Discrete Event Dynamic Systems
Some Classes of Regular Languages Identifiable in the Limit from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Fragmentation: Enhancing Identifiability
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Approximative Learning of Regular Languages
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Locality, Reversibility, and Beyond: Learning Languages from Positive Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Identification of function distinguishable languages
Theoretical Computer Science
Learning in varieties of the form V*LI from positive data
Theoretical Computer Science
Learning and extending sublanguages
Theoretical Computer Science
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Journal of Computer and System Sciences
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
| Hi-index | 5.23 |