1. Introduction

   EditorialNotes Pages: 105 - 107

2. Introduction

   • David S. Touretzky

   Introduction Pages: 105 - 107

3. Learning automata from ordered examples

   • Sara Porat
   • Jerome A. Feldman

   OriginalPaper Pages: 109 - 138

4. Learning Automata from Ordered Examples

   • Sara Porat
   • Jerome A. Feldman

   OriginalPaper Pages: 109 - 138

5. SLUG: A Connectionist Architecture for Inferring the Structure of Finite-State Environments

   • Michael C. Mozer
   • Jonathan Bachrach

   OriginalPaper Pages: 139 - 160

6. SLUG: A connectionist architecture for inferring the structure of finite-state environments

   • Michael C. Mozer
   • Jonathan Bachrach

   OriginalPaper Pages: 139 - 160

7. Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks

   • David Servan-Schreiber
   • Axel Cleeremans
   • James L. McClelland

   OriginalPaper Pages: 161 - 193

8. Graded state machines: The representation of temporal contingencies in simple recurrent networks

   • David Servan-Schreiber
   • Axel Cleeremans
   • James L. Mcclelland

   OriginalPaper Pages: 161 - 193

9. Distributed Representations, Simple Recurrent Networks, And Grammatical Structure

   • Jeffrey L. Elman

   OriginalPaper Pages: 195 - 225

10. Distributed representations, simple recurrent networks, and grammatical structure

    • Jeffrey L. Elman

    OriginalPaper Pages: 195 - 225

11. The induction of dynamical recognizers

    • Jordan B. Pollack

    OriginalPaper Pages: 227 - 252

12. The Induction of Dynamical Recognizers

    • Jordan B. Pollack

    OriginalPaper Pages: 227 - 252