Can I read Equivalence of real-time DPDAs and discrete extended simple recurrent networks with some restrictions on EtoBox?

Equivalence of real-time DPDAs and discrete extended simple recurrent networks with some restrictions by Junnosuke Moriya; Tetsuro Nishino is a Computer Science article available to read on EtoBox.

What is Equivalence of real-time DPDAs and discrete extended simple recurrent networks with some restrictions about?

## Abstract To model human natural language processing using computation theory, Elman proposed a simple recurrent network. A simple recurrent network is a recurrent neural network with restrictions added to the connections between gates. When the range of the function for computing each gate of a simple recurrent network is a finite set (this is called a discrete simple recurrent network), its computational capability is known to be equivalent to that of a finite automaton with output. This paper introduces a modification of a discrete simple recurrent network so that it has a computational capability equivalent to that of a real‐time deterministic pushdown automaton (real‐time DPDA). In other words, the discrete simple recurrent network is extended as follows. (1) It contains a number of gates equal to a constant multiple of the input length, and (2) those gates can be used to simulate a stack with a depth of at most the input length. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(7): 55–62, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10275

Who reads Equivalence of real-time DPDAs and discrete extended simple recurrent networks with some restrictions?

Author

Junnosuke Moriya; Tetsuro Nishino

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0882-1666)

Published

2003

Language

EN

Field

Computer Science (Physical Sciences)