Stack-like and queue-like dynamics in recurrent neural networks

DOI10.1080/09540090500317291zbMath1084.68097OpenAlexW2158191188MaRDI QIDQ3375554

André Grüning

Publication date: 14 March 2006

Published in: Connection Science (Search for Journal in Brave)

Full work available at URL: http://epubs.surrey.ac.uk/22858/2/gruening_05_connection_science.pdf

zbMATH Keywords

network dynamicsformal languagesdynamical complexitysimple current networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (1)

Elman Backpropagation as Reinforcement for Simple Recurrent Networks

Uses Software

• LSTM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamical recognizers: real-time language recognition by analog computers
• QRT FIFO automata, breadth-first grammars and their relations
• Why it might pay to assume that languages are infinite
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Learning the dynamics of embedded clauses
• The calculi of emergence: Computation, dynamics and induction
• On the computational power of neural nets
• Spatiotemporal Connectionist Networks: A Taxonomy and Review
• Simple Recurrent Networks Learn Context-Free and Context-Sensitive Languages by Counting
• Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM
• Rule Extraction from Recurrent Neural Networks: ATaxonomy and Review
• Recurrent Neural Networks with Small Weights Implement Definite Memory Machines
• Architectural Bias in Recurrent Neural Networks: Fractal Analysis
• Three models for the description of language
• A logical calculus of the ideas immanent in nervous activity
• Rules and arithmetics

This page was built for publication: Stack-like and queue-like dynamics in recurrent neural networks