The equivalence and inclusion problems for NTS languages
Journal of Computer and System Sciences
NTS languages are deterministic and congruential
Journal of Computer and System Sciences
Negative Results for Equivalence Queries
Machine Learning
An elementary proof of double Greibach normal form
Information Processing Letters
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Matrix Equations and Normal Forms for Context-Free Grammars
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
On inferring zero-reversible languages
Acta Cybernetica
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
On Approximately Identifying Concept Classes in the Limit
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Interactive learning of node selecting tree transducer
Machine Learning
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
A bibliographical study of grammatical inference
Pattern Recognition
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
PAC-learning unambiguous NTS languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning reversible languages with terminal distinguishability
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Learning context free grammars with the syntactic concept lattice
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
PAC-learning unambiguous k, l-NTS≤languages
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Towards general algorithms for grammatical inference
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Using Contextual Representations to Efficiently Learn Context-Free Languages
The Journal of Machine Learning Research
Theoretical Computer Science
Towards dual approaches for learning context-free grammars based on syntactic concept lattices
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Semantic separator learning and its applications in unsupervised Chinese text parsing
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Recently Clark and Eyraud (2005, 2007) have shown that substitutable context-free languages are polynomial-time identifiable in the limit from positive data. Substitutability in context-free languages can be thought of as the analogue of reversibility in regular languages. While reversible languages admit a hierarchy, namely k-reversible regular languages for each nonnegative integer k, Clark and Eyraud targeted the subclass of context-free languages that corresponds to zero-reversible regular languages only. Following Clark and Eyraud's proposal, this paper introduces a hierarchy of substitutable context-free languages as the analogue of that of k-reversible regular languages and shows that each class in the hierarchy is also polynomial-time identifiable in the limit from positive data.