Information Processing Letters
Non-deterministic two-tape automata are more powerful than deterministic ones
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Learning regular sets from queries and counterexamples
Information and Computation
Grammatical interface for even linear languages based on control sets
Information Processing Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Negative Results for Equivalence Queries
Machine Learning
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Learning regular languages from counterexamples
Journal of Computer and System Sciences
Learning semilinear sets from examples and via queries
Theoretical Computer Science
A geometric hierarchy beyond context-free languages
Theoretical Computer Science
Special families of matrix languages and decidable problems
Acta Cybernetica
Asking questions to minimize errors
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Inference of finite automata using homing sequences
Information and Computation
A hierarchy of language families learnable by regular language learning
Information and Computation
Learning non-deterministic finite automata from queries and counterexamples
Machine intelligence 13
A note on the grammatical inference problem for even linear languages
Fundamenta Informaticae
Natural language understanding: a new challenge for grammar systems
Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
Learning deterministic even linear languages from positive examples
Theoretical Computer Science - Special issue on algorithmic learning theory
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Learning deterministic finite automata from smallest counterexamples
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Inference of Reversible Languages
Journal of the ACM (JACM)
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Permutations and Control Sets for Learning Non-regular Language Families
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
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
Learning behaviors of automata from shortest counterexamples
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
On Learning Systolic Languages
ALT '92 Proceedings of the Third Workshop on Algorithmic Learning Theory
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
Comparisons and Reset Machines (Preliminary Report)
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Effiscient learning of some linear matrix languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
Constructing an even grammar from a 2-element sample
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Hölder norms and a hierarchy theorem for parameterized classes of CCG
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Generalizing over several learning settings
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Workspace theorems for regular-controlled grammars
Theoretical Computer Science
| Hi-index | 5.23 |
We show that so-called deterministic even linear simple matrix grammars can be inferred in polynomial time using the query-based learner-teacher model (minimally adequate teacher-learning model) proposed by Angluin (Inform. and Comput. 75 (1987) 87) for learning deterministic regular languages. In this way, we extend the class of efficiently learnable languages beyond both the even linear languages and the even equal matrix languages (Pattern Recognition 21 (1988) 55; Proc. 2nd Internat. Colloq. on Grammatical Inference (ICGI-94): Grammatical Inference and Applications, Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, 1994, p. 38; Inform. Process. Lett. 28 (1988) 193; Technical Report IIAS-RR-93-6E, Fujitsu Laboratories, 1992; Parallel Image Analysis, ICPIA'92, Lecture Notes in Computer Science, vol. 652, Springer, Berlin, 1992, p. 274; Inform. and Comput. 123 (1995) 138; Algorithmic Learning for Knowledge-Based Systems, Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence, Springer, Berlin, 1995, p. 317). Moreover, we investigate formal language properties of even linear simple matrix languages and related language classes. More precisely, we discuss characterizations, (proper) inclusion relations, closure properties and decidability questions. This way, we also show that, in a certain sense, the idea of iterating the control language approach for learning purposes, as undertook by Takada (1995), could be seen as a special case of using deterministic even linear simple matrix grammars as basic and uniform learning target.