Learning exponential state-growth languages by hill climbing

IEEE Transactions on Neural Networks

Volumn 14, Issue 2, 2003, Pages 444-446

  Tabor, Whitney ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; CONSTRAINT THEORY; CONTEXT FREE LANGUAGES; FRACTALS; LEARNING SYSTEMS; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBABILITY DISTRIBUTIONS; RADIAL BASIS FUNCTION NETWORKS;

FRACTAL LEARNING NEURAL NETWORK; GAUSSIAN ACTIVATION FUNCTION; PUSHDOWN DYNAMICAL AUTOMATA;

RECURRENT NEURAL NETWORKS;

EID: 0037360272     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2003.809421     Document Type: Letter

References (13)

1. H. T. Siegelmann, Neural Networks and Analog Computation: Beyond the Turing Limit. Boston, MA: Birkhäuser, 1999.
2. J. Wiles and J. Elman, "Landscapes in recurrent networks," in Proc. 17th Annu. Cognitive Science Conf., J. D. Moore and J. F. Lehman, Eds., 1995.
3. P. Rodriguez and J. Wiles, "Recurrent neural networks can learn to implement symbol-sensitive counting," in Advances in Neural Information Processing Systems 10, M. Jordan, M. Kearns, and S. Solla, Eds. Cambridge, MA: MIT Press, 1998, pp. 87-93.
4. M. Bodén and J. Wiles, "Context-free and context sensitive dynamics in recurrent neural networks," Connection Sci., vol. 12, no. 3, pp. 197-210, 2000.
5. F. A. Gers and J. Schmidhuber, "LSTM recurrent networks learn simple context-free and context-sensitive languages," IEEE Trans. Neural Networks, vol. 12, pp. 1333-1340, Nov. 2001.
6. P. Rodriguez, "Simple recurrent networks learn context-free and context-sensitive languages by counting," Neural Comput., vol. 13, no. 9, 2001.
7. M. Bodén and J. Wiles, "On learning context-free and context-sensitive languages," IEEE Trans. Neural Networks, vol. 13, pp. 491-493, Mar. 2002.
8. W. Tabor, "The value of symbolic computation," Ecol. Psych., vol. 14, no. 1/2, pp. 21-52, 2002.
9. M. Barnsley, Fractals Everywhere. Boston, MA: Academic, 1988.
10. C. Moore, "Dynamical recognizers: Real-time language recognition by analog computers," Theoretical Comput. Sci., vol. 201, pp. 99-136, 1998.
11. P. Tiňo, "Spatial representation of symbolic sequences through iterative function systems," IEEE Trans. Syst., Man, Cybern. A, vol. 29, pp. 386-392, July 1999.
12. W. Tabor, "Fractal encoding of context-free grammars in connectionist networks," Expert Systems: Int. J. Knowledge Eng. Neural Networks, vol. 17, no. 1, pp. 41-56, 2000.
13. S. Hölldobler, Y. Kalinke, and H. Lehmann, "Designing a counter: Another case study of dynamics and activation landscapes in recurrent networks," in Advances in Artificial Intelligence. Berlin, Germany: Springer, 1997, pp. 313-324.