Effiscient learning of some linear matrix languages

Authors:
Henning Fernau
Affiliations:
Wilhelm-Schickard-Institut fü/r Informatik/ Universitä/t Tü/bingen, Tü/bingen, Germany
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 12
Cited 2

Learning regular sets from queries and counterexamples

Information and Computation
Grammatical interface for even linear languages based on control sets

Information Processing Letters
Inference of even linear grammars and its applications to picture description languages

Pattern Recognition
A geometric hierarchy beyond context-free languages

Theoretical Computer Science
A hierarchy of language families learnable by regular language learning

Information and Computation
A note on the grammatical inference problem for even linear languages

Fundamenta Informaticae
Learning deterministic even linear languages from positive examples

Theoretical Computer Science - Special issue on algorithmic learning theory
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Learning Even Equal Matrix Languages Based on Control Sets

ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
Learning Formal Languages Based on Control Sets

Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
A Characterization of Even Linear Languages and its Application to the Learning Problem

ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Feasible learnability of formal grammars and the theory of natural language acquisition

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Even linear simple matrix languages: formal language properties and grammatical inference

Theoretical Computer Science
Fragmentation: Enhancing Identifiability

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that so-called deterministic even linear simple matrix grammars can be inferred in polynomial time using the query-based learner-teacher model proposed by Angluin for learning deterministic regular languages in [3]. In such a way, we extend the class of efficiently learnable languages both beyond the even linear languages and the even equal matrix languages proposed in [10, 11, 13, 14, 15, 16, 17].