Simulation of stochastic regular grammars through simple recurrent networks-Reference-Cited by-同舟云学术

Simulation of stochastic regular grammars through simple recurrent networks

Published:1993 Issue: Volume: Page:210-215
ISSN:0302-9743
Container-title:New Trends in Neural Computation
language:
Short-container-title:

Author:

Castaño M. A.,Casacuberta F.,Vidal E.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56798-4_149.pdf

Reference13 articles.

1. Continuous Speech Recognition: From Hidden Markov Models to Neural Networks. H. Boulard. EUSIPCO'92, vol. 1, pp. 63–70. 1992.

2. Finding Structure in Time. Elman,J.L. Technical Report 8801. Center for Research in Language. University of California. La Jolla. 1988.

3. Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks. Giles,C.L et al. Neural Computation, no. 4, pp. 393–405, 1992.

4. Serial order: A parallel distributed processing approach. Jordan,M.I. Technical Report No. 8604. Institute of Cognitive Science. University of California. San Diego. 1988.

5. Minsky,M.L. Computation: Finite and Infinite Machines, Chap. 3.5. Ed. Prentice-Hall Prentice-Hall, Englewood Cliffs, New York. 1967.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inference of Stochastic Regular Languages through Simple Recurrent Networks with Time Delays;Bio-Inspired Applications of Connectionism;2001

2. Learning deterministic regular grammars from stochastic samples in polynomial time;RAIRO - Theoretical Informatics and Applications;1999-01

3. Inferring stochastic regular grammars with recurrent neural networks;Grammatical Interference: Learning Syntax from Sentences;1996

4. Finite State Automata and Connectionist Machines: A survey;Lecture Notes in Computer Science;1995

5. Learning stochastic regular grammars by means of a state merging method;Grammatical Inference and Applications;1994