Recent advances of grammatical inference

Abe, 1994, A new method for predicting protein secondary structures based on stochastic tree grammars, 3

Abe, 1992, On the computational complexity of approximating distributions by probabilistic automata, Machine Learning, 9, 205, 10.1007/BF00992677

Aha, 1991, Instance-based learning algorithms, Machine Learning, 6, 37, 10.1007/BF00153759

Aho, 1972, Parsing, vol. I

Angluin, 1980, Finding patterns common to a set of strings, J. Comput. System Sci., 21, 46, 10.1016/0022-0000(80)90041-0

Angluin, 1980, Inductive inference of formal languages from positive data, Inform. Control, 45, 117, 10.1016/S0019-9958(80)90285-5

Angluin, 1981, A note on the number of queries needed to identify regular languages, Inform. Control, 51, 76, 10.1016/S0019-9958(81)90090-5

Angluin, 1982, Inference of reversible languages, J. ACM, 29, 741, 10.1145/322326.322334

Angluin, 1987, Learning regular sets from queries and counter-examples, Inform. Comput., 75, 87, 10.1016/0890-5401(87)90052-6

Angluin, 1988, Queries and concept learning, Machine Learning, 2, 319, 10.1007/BF00116828

Angluin, 1990, Negative results for equivalence queries, Machine Learning, 5, 121, 10.1007/BF00116034

Angluin, 1992, Computational learning theory: survey and selected bibliography, 351

Angluin, 1991, When won't membership queries help?, 444

Angluin, 1983, Inductive inference: theory and methods, ACM Comput. Surveys, 15, 237, 10.1145/356914.356918

Arikawa, 1989, Elementary formal systems as a unifying framework for language learning, 312

Baker, 1979, Trainable grammars for speech recognition, 547

Brāzma, 1994, Efficient learning of regular expressions from good examples, Vol. 872, 76

Burago, 1994, Learning structurally reversible context-free grammars from queries and counterexamples in polynomial time, 140

1994, Vol. 862

Crespi-Reghizzi, 1972, An effective model for grammar inference, 524

Dupon, 1994, Regular grammatical inference from positive and negative samples by genetic search: the GIG method, Vol. 862, 236

Elman, 1991, Distributed representations, simple recurrent networks, and grammatical structure, Machine Learning, 7, 195, 10.1007/BF00114844

Fahmy, 1993, Synthesis of real time acceptors, J. Symbolic Comput., 15, 807, 10.1016/S0747-7171(06)80013-1

Giles, 1990, Higher order recurrent networks & grammatical inference, Vol. 2, 380

Globig, 1997, On case-based learnability of languages, New Generation Comput., 15, 59, 10.1007/BF03037560

Globig, 1994, On case-based representability and learnability of languages, Vol. 872, 106

Gold, 1967, Language identification in the limit, Inform. Control, 10, 447, 10.1016/S0019-9958(67)91165-5

Gold, 1978, Complexity of automaton identification from given data, Inform. Control, 37, 302, 10.1016/S0019-9958(78)90562-4

Golea, 1996, Simple recurrent neural networks as probability models, 68

Hertz, 1991

Hunter, 1993

Ishizaka, 1990, Polynomial time learnability of simple deterministic languages, Machine Learning, 5, 151, 10.1007/BF00116035

Jantke, 1995, Case-based representation and learning of pattern languages, Theoret. Comput. Sci., 137, 25, 10.1016/0304-3975(95)91134-C

Koshiba, 1995, Typed pattern languages and their learnability, Vol. 904, 367

Krogh, 1994, Hidden Markov models in computational biology: Applications to protein modeling, J. Molecular Biol., 235, 1501, 10.1006/jmbi.1994.1104

Laird, 1990, A survey of computational learning theory, 173

Lari, 1990, The estimation of stochastic context-free grammars using the inside-outside algorithm, Comput. Speech Language, 4, 35, 10.1016/0885-2308(90)90022-X

Levy, 1978, Skeletal structural descriptions, Inform. Control, 39, 192, 10.1016/S0019-9958(78)90849-5

Makinen, 1992, On the structural grammatical inference problem for some classes of context-free grammars, Inform. Process. Lett., 42, 193, 10.1016/0020-0190(92)90124-E

Miclet, 1986, Grammatical inference, 237

1996, Vol. 1147

Miyano, 1991, Which classes of elementary formal systems are polynomialtime learnable?, 139

Oncina, 1993, Learning subsequential transducers for pattern recognition interpretation tasks, IEEE Trans. Pattern Anal. Machine Intelligence, 15, 448, 10.1109/34.211465

Pereira, 1992, Inside-outside reestimation for partially bracketed corpora, 128

Pitt, 1989, Inductive inference, DFAs, and computational complexity, Vol. 397, 18

Pitt, 1989, The minimum consistent DFA problem cannot be approximated within any polynomial

Rabiner, 1989, A tutorial on hidden Markov models and selected applications in speech recognition, 77, 257

Rivest, 1987, Learning decision lists, Machine Learning, 2, 229, 10.1007/BF00058680

Ron, 1995, Learning fallible deterministic finite automata, Machine Learning, 18, 149, 10.1007/BF00993409

Sakakibara, 1990, Learning context-free grammars from structural data in polynomial time, Theoret. Comput. Sci., 76, 223, 10.1016/0304-3975(90)90017-C

Sakakibara, 1991, On learning from queries and counterexamples in the presence of noise, Inform. Processing Lett., 37, 279, 10.1016/0020-0190(91)90220-C

Sakakibara, 1992, Efficient learning of context-free grammars from positive structural examples, Inform. Comput., 97, 23, 10.1016/0890-5401(92)90003-X

Sakakibara, 1994, Stochastic context-free grammars for tRNA modeling, Nucleic Acids Res., 22, 5112, 10.1093/nar/22.23.5112

Sakakibara, 1995, Simple recurrent networks as generalized hidden markov models with distributed representations, 979

Sakakibara, 1994, Learning languages by collecting cases and tuning parameters, Vol. 872, 532

Sakakibara, 1992, A noise model on learning sets of strings, 295

Searls, 1992, The linguistics of DNA, Amer. Scientist, 80, 579

Shinohara, 1994, Rich classes inferable from positive data: length-bounded elementary formal systems, Inform. Comput., 108, 175, 10.1006/inco.1994.1006

Stolcke, 1994, Inducing probabilistic grammars by bayesian model merging, Vol. 862, 106

Takada, 1988, Grammatical inference for even linear languages based on control sets, Inform. Processing Lett., 28, 193, 10.1016/0020-0190(88)90208-6

Takada, 1995, A hierarchy of language families learnable by regular language learners, Inform. Comput., 123, 138, 10.1006/inco.1995.1163

Trakhtenbrot, 1973, Finite Automata — Behavior and Synthesisa

Valiant, 1984, A theory of the learnable, Comm ACM, 27, 1134, 10.1145/1968.1972

Waterman, 1989, Sequence alignments

Wiehagen, 1994, From inductive inference to algorithmic learning theory, New Generation Comput., 12, 321, 10.1007/BF03037350

Yokomori, 1991, Polynomial-time learning of very simple grammars from positive data, 213

Yokomori, 1994, Learning nondeterministic finite automata from queries and counterexamples, 13, 169

Yokomori, 1995, On polynomial-time learnability in the limit of strictly deterministic automata, Machine Learning, 19, 153, 10.1007/BF01007463

Zeugmann, 1995, A guided tour across the boundaries of learning recursive languages, Vol. 961, 193