Identification of pattern languages from examples and queries
Information and Computation
Learning regular sets from queries and counterexamples
Information and Computation
Polynomial Time Learnability of Simple Deterministic Languages
Machine Learning
Learning pattern languages from a single initial example and from queries
COLT '88 Proceedings of the first annual workshop on Computational learning theory
A polynomial-time algorithm for learning k-variable pattern languages from examples
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Inductive inference of unbounded unions of pattern languages from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Machine Learning
Machine Learning
Constructive Learning of Context-Free Languages with a Subpansive Tree
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Learning Pattern Languages Using Queries
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Language Learning from Membership Queries and Characteristic Examples
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Learning Erasing Pattern Languages with Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
| Hi-index | 0.00 |
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular pattern languages. For the former, we mainly show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, we show that both bounded finite unions of regular pattern languages and unbounded finite unions of substring pattern languages are pwm-reducible to DFAs.