The equivalence and inclusion problems for NTS languages
Journal of Computer and System Sciences
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
DATR: a language for lexical knowledge representation
Computational Linguistics
Inference of Reversible Languages
Journal of the ACM (JACM)
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Marcus Contextual Grammars
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Chinese numbers, MIX, scrambling, and range concatenation grammars
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
PAC-learnability of Probabilistic Deterministic Finite State Automata
The Journal of Machine Learning Research
On a Construction of Context-free Grammars
Fundamenta Informaticae
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
A Polynomial Algorithm for the Inference of Context Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
On deterministic finite automata and syntactic monoid size
DLT'02 Proceedings of the 6th international conference on Developments in language theory
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
A learnable representation for syntax using residuated lattices
FG'09 Proceedings of the 14th international conference on Formal grammar
PAC-learning unambiguous NTS languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Generalizing over several learning settings
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
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
| Hi-index | 0.00 |
Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable representations is by making them objective or empiricist: the structure of the representation should be based on the structure of the language. Rather than defining a function from representation to language we should start by defining a function from the language to the representation: following this strategy gives classes of representations that are easy to learn. We illustrate this approach with three classes, defined in analogy to the lowest three levels of the Chomsky hierarchy. First, we recall the canonical deterministic finite automaton, where the states of the automaton correspond to the right congruence classes of the language. Secondly, we define context free grammars where the non-terminals of the grammar correspond to the syntactic congruence classes, and where the productions are defined by the syntactic monoid; finally we define a residuated lattice structure from the Galois connection between strings and contexts, which we call the syntactic concept lattice, and base a representation on this, which allows us to define a class of languages that includes some non-context free languages, many context-free languages and all regular languages. All three classes are efficiently learnable under suitable learning paradigms.