Correction To Proof That Recurrent Neural Networks Can Robustly Recognize Only Regular Languages.
Michael CaseyPublished in: Neural Comput. (1998)
Keyphrases
- recurrent neural networks
- regular languages
- context free languages
- regular expressions
- grammatical inference
- finite automata
- decision problems
- neural network
- feed forward
- pac learning
- context free grammars
- recurrent networks
- positive data
- echo state networks
- artificial neural networks
- finite state machines
- context free
- pattern matching
- database
- genetic algorithm
- statistical queries
- query language
- xml schema
- inductive inference
- cross validation
- matching algorithm