Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Inference of regular grammars via skeletons
IEEE Transactions on Systems, Man and Cybernetics
One-unambiguous regular languages
Information and Computation
Inference of Reversible Languages
Journal of the ACM (JACM)
Parallel communicating grammar systems with terminal transmission
Acta Informatica
Introduction to Algorithms
MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Current Trends in Grammatical Inference
Proceedings of the Joint IAPR International Workshops on Advances 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
Identification of Function Distinguishable Languages
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Fragmentation: Enhancing Identifiability
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.