Hölder norms and a hierarchy theorem for parameterized classes of CCG

Authors:
Christophe Costa Florêncio;Henning Fernau
Affiliations:
Department of Computer Science, K.U. Leuven, Leuven, Belgium;Universität Trier, FB IV, Abteilung Informatik, Trier, Germany
Venue:
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Year:
2010

Citing 7
Cited 1

A hierarchy of language families learnable by regular language learning

Information and Computation
Learnable classes of categorial grammars

Learnable classes of categorial grammars
Inference of Reversible Languages

Journal of the ACM (JACM)
Even linear simple matrix languages: formal language properties and grammatical inference

Theoretical Computer Science
Permutations and Control Sets for Learning Non-regular Language Families

ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach

Information and Computation
Finding consistent categorial grammars of bounded value: a parameterized approach

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

On families of categorial grammars of bounded value, their learnability and related complexity questions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a framework based on Hölder norms that allows us to easily transfer learnability results. This idea is concretized by applying it to Classical Categorial Grammars (CCG).