Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Blair, A. D.
Right arrow Articles by Pollack, J. B.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Blair, A. D.
Right arrow Articles by Pollack, J. B.

Neural Computation, Vol 9, 1127-1142, Copyright © 1997 by The MIT Press

LETTERS

Analysis of Dynamical Recognizers

Alan D. Blair and Jordan B. Pollack

Pollack (1991) demonstrated that second-order recurrent neural networks can act as dynamical recognizers for formal languages when trained on positive and negative examples, and observed both phase transitions in learning and interacted function system-like fractal state sets. Follow-on work focused mainly on the extraction and minimization of a finite state automaton (FSA) from the trained network. However, such networks are capable of inducing languages that are not regular and therefore not equivalent to any FSA. Indeed, it may be simpler for a small network to fit its training data by inducing such a nonregular language. But when is the network's language not regular? In this article, using a low-dimensional network capable of learning all the Tomita data sets, we present an empirical method for testing whether the language induced by the network is regular. We also provide a detailed ε-machine analysis of trained networks for both regular and nonregular languages.


This article has been cited by other articles:


Home page
 Neural Comput.Home page
H. Jacobsson
The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx.
Neural Comput., September 1, 2006; 18(9): 2211 - 2255.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
H. Jacobsson
Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review
Neural Comput., June 1, 2005; 17(6): 1223 - 1263.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
P. Tino and B. Hammer
Architectural Bias in Recurrent Neural Networks: Fractal Analysis
Neural Comput., August 1, 2003; 15(8): 1931 - 1957.
[Abstract] [Full Text]

Home page
 Neural Comput.Home page
P. Rodriguez
Simple Recurrent Networks Learn Context-Free and Context-Sensitive Languages by Counting
Neural Comput., September 1, 2001; 13(9): 2093 - 2118.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
R. C. Carrasco, M. L. Forcada, M. A. Valdés-Muñoz, and R. P. Ñeco
Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units
Neural Comput., September 1, 2000; 12(9): 2129 - 2174.
[Abstract] [Full Text]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1997 by The MIT Press.