Computational learning of languages
Computational learning of languages
Efficient learning of context-free grammars from positive structural examples
Information and Computation
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Handbook of formal languages, vol. 1
Learnable classes of categorial grammars
Learnable classes of categorial grammars
Inference of Reversible Languages
Journal of the ACM (JACM)
Learning Regular Languages Using Non Deterministic Finite Automata
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Residual Finite State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Learning Concatenations of Locally Testable Languages from Positive Data
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Locality, Reversibility, and Beyond: Learning Languages from Positive Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Identification of Function Distinguishable Languages
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Learning Regular Languages Using RFSA
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning regular languages using RFSAs
Theoretical Computer Science - Special issue: Algorithmic learning theory
Identification of biRFSA languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Learning Left-to-Right and Right-to-Left Iterative Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A bibliographical study of grammatical inference
Pattern Recognition
DLT'03 Proceedings of the 7th international conference on Developments in language theory
When categorial grammars meet regular grammatical inference
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Learnability of automatic classes
Journal of Computer and System Sciences
Automatic learners with feedback queries
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Angluin defined in [Ang82] the classes of k-reversible regular languages and showed that these classes are identifiable in the limit from positive data. We introduced in [DLT01b] a class of automata based on properties of residual languages (RFSA) and showed in [DLT00] and [DLT01a] that this class could be interesting for grammatical inference purpose. Here, we study properties of 0-reversible languages that can be expressed as properties of their residual languages and that are useful for identification from positive data. This leads us to define classes of languages which strictly contain the class of 0-reversible languages and are identifiable in the limit from positive data.