These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
135 related articles for article (PubMed ID: 12576110)
1. On-line identification and reconstruction of finite automata with generalized recurrent neural networks. Gabrijel I; Dobnikar A Neural Netw; 2003 Jan; 16(1):101-20. PubMed ID: 12576110 [TBL] [Abstract][Full Text] [Related]
2. Identification of finite state automata with a class of recurrent neural networks. Won SH; Song I; Lee SY; Park CH IEEE Trans Neural Netw; 2010 Sep; 21(9):1408-21. PubMed ID: 20709639 [TBL] [Abstract][Full Text] [Related]
3. A modular architecture for transparent computation in recurrent neural networks. Carmantini GS; Beim Graben P; Desroches M; Rodrigues S Neural Netw; 2017 Jan; 85():85-105. PubMed ID: 27814468 [TBL] [Abstract][Full Text] [Related]
4. New learning automata based algorithms for adaptation of backpropagation algorithm parameters. Meybodi MR; Beigy H Int J Neural Syst; 2002 Feb; 12(1):45-67. PubMed ID: 11852444 [TBL] [Abstract][Full Text] [Related]
5. A machine learning method for extracting symbolic knowledge from recurrent neural networks. Vahed A; Omlin CW Neural Comput; 2004 Jan; 16(1):59-71. PubMed ID: 15006023 [TBL] [Abstract][Full Text] [Related]
6. Finite time analysis of the pursuit algorithm for learning automata. Rajaraman K; Sastry PS IEEE Trans Syst Man Cybern B Cybern; 1996; 26(4):590-8. PubMed ID: 18263056 [TBL] [Abstract][Full Text] [Related]
7. Simultaneous perturbation learning rule for recurrent neural networks and its FPGA implementation. Maeda Y; Wakamura M IEEE Trans Neural Netw; 2005 Nov; 16(6):1664-72. PubMed ID: 16342505 [TBL] [Abstract][Full Text] [Related]
8. Implementing Gaussian process inference with neural networks. Frean M; Lilley M; Boyle P Int J Neural Syst; 2006 Oct; 16(5):321-7. PubMed ID: 17117493 [TBL] [Abstract][Full Text] [Related]
9. Recurrent neural-network training by a learning automaton approach for trajectory learning and control system design. Sudareshan MK; Condarcure TA IEEE Trans Neural Netw; 1998; 9(3):354-68. PubMed ID: 18252461 [TBL] [Abstract][Full Text] [Related]
10. Learning deterministic finite automata with a smart state labeling evolutionary algorithm. Lucas SM; Reynolds TJ IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1063-74. PubMed ID: 16013754 [TBL] [Abstract][Full Text] [Related]
11. Last-position elimination-based learning automata. Zhang J; Wang C; Zhou M IEEE Trans Cybern; 2014 Dec; 44(12):2484-92. PubMed ID: 24710837 [TBL] [Abstract][Full Text] [Related]
12. Abductive learning of quantized stochastic processes with probabilistic finite automata. Chattopadhyay I; Lipson H Philos Trans A Math Phys Eng Sci; 2013 Feb; 371(1984):20110543. PubMed ID: 23277601 [TBL] [Abstract][Full Text] [Related]
13. Generalized rough and fuzzy rough automata for semantic computing. Yadav S; Tiwari SP; Kumari M; Yadav VK Int J Mach Learn Cybern; 2022; 13(12):4013-4032. PubMed ID: 36164557 [TBL] [Abstract][Full Text] [Related]
19. Learning beyond finite memory in recurrent networks of spiking neurons. Tino P; Mills AJ Neural Comput; 2006 Mar; 18(3):591-613. PubMed ID: 16483409 [TBL] [Abstract][Full Text] [Related]
20. Evolution of cellular automata with memory: The Density Classification Task. Stone C; Bull L Biosystems; 2009 Aug; 97(2):108-16. PubMed ID: 19442703 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]