Dynamical recognizers: real-time language recognition by analog computers
From MaRDI portal
Publication:1129007
DOI10.1016/S0304-3975(97)00028-5zbMath0902.68098OpenAlexW1970278892MaRDI QIDQ1129007
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00028-5
Related Items
An analog characterization of the Grzegorczyk hierarchy, Iteration, inequalities, and differentiability in analog computers, Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations, Simple Recurrent Networks Learn Context-Free and Context-Sensitive Languages by Counting, Elman Backpropagation as Reinforcement for Simple Recurrent Networks, Stack-like and queue-like dynamics in recurrent neural networks, A new conceptual framework for analog computation, Quantum automata and quantum grammars, What is a universal computing machine?, Universal Neural Field Computation, Inverse problems in dynamic cognitive modeling, Analog computation with dynamical systems
Cites Work
- A weak version of the Blum, Shub, and Smale model
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- QRT FIFO automata, breadth-first grammars and their relations
- A class of measures on formal languages
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Real number models under various sets of operations
- Analog computation via neural networks
- Computability with low-dimensional dynamical systems
- Computing over the reals with addition and order
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Learnability and the Vapnik-Chervonenkis dimension
- New Real-Time Simulations of Multihead Tape Units
- The Rational Index: A Complexity Measure for Languages
- Generalized one-sided shifts and maps of the interval
- On digital nondeterminism
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Real-Time Definable Languages
- A note on undecidable properties of formal languages
- Lower Bounds for Approximation by Nonlinear Manifolds
- Quasi-realtime languages
- An infinite hierarchy of intersections of context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
