Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Bounds on the complexity of recurrent neural network implementations of finite state machines

Published: 01 March 1996 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2021)Evaluation of Machine Learning Algorithms in Predicting the Next SQL Query from the FutureACM Transactions on Database Systems10.1145/344233846:1(1-46)Online publication date: 18-Mar-2021
  • (2019)One Analog Neuron Cannot Recognize Deterministic Context-Free LanguagesNeural Information Processing10.1007/978-3-030-36718-3_7(77-89)Online publication date: 12-Dec-2019
  • (2019)Robust Optimal-Size Implementation of Finite State Automata with Synfire Ring-Based Neural NetworksArtificial Neural Networks and Machine Learning – ICANN 2019: Theoretical Neural Computation10.1007/978-3-030-30487-4_62(806-818)Online publication date: 17-Sep-2019
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Neural Networks
Neural Networks  Volume 9, Issue 2
March 1996
174 pages
ISSN:0893-6080
Issue’s Table of Contents

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 March 1996

Author Tags

  1. automata theory
  2. circuit complexity
  3. finite state machines
  4. logic synthesis
  5. neural networks
  6. recurrent neural networks

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Evaluation of Machine Learning Algorithms in Predicting the Next SQL Query from the FutureACM Transactions on Database Systems10.1145/344233846:1(1-46)Online publication date: 18-Mar-2021
  • (2019)One Analog Neuron Cannot Recognize Deterministic Context-Free LanguagesNeural Information Processing10.1007/978-3-030-36718-3_7(77-89)Online publication date: 12-Dec-2019
  • (2019)Robust Optimal-Size Implementation of Finite State Automata with Synfire Ring-Based Neural NetworksArtificial Neural Networks and Machine Learning – ICANN 2019: Theoretical Neural Computation10.1007/978-3-030-30487-4_62(806-818)Online publication date: 17-Sep-2019
  • (2019)Counting with Analog NeuronsArtificial Neural Networks and Machine Learning – ICANN 2019: Theoretical Neural Computation10.1007/978-3-030-30487-4_31(389-400)Online publication date: 17-Sep-2019
  • (2018)Quasi-periodic -expansions and cut languagesTheoretical Computer Science10.1016/j.tcs.2018.02.028720:C(1-23)Online publication date: 11-Apr-2018
  • (2018)Three Analog Neurons Are Turing UniversalTheory and Practice of Natural Computing10.1007/978-3-030-04070-3_36(460-472)Online publication date: 12-Dec-2018
  • (2014)Energy complexity of recurrent neural networksNeural Computation10.1162/NECO_a_0057926:5(953-973)Online publication date: 1-May-2014
  • (2013)A Low-Energy Implementation of Finite Automata by Optimal-Size Neural NetsProceedings of the 23rd International Conference on Artificial Neural Networks and Machine Learning — ICANN 2013 - Volume 813110.1007/978-3-642-40728-4_15(114-121)Online publication date: 10-Sep-2013
  • (2010)The complexity of regular(-like) expressionsProceedings of the 14th international conference on Developments in language theory10.5555/1881463.1881467(16-30)Online publication date: 17-Aug-2010
  • (2007)Group-Linking MethodIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1093/ietfec/e90-a.12.2916E90-A:12(2916-2929)Online publication date: 1-Dec-2007
  • Show More Cited By

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media