Dynamical recognizers: real-time language recognition by analog computers
From MaRDI portal
Publication:1129007
Recommendations
Cites work
- A class of measures on formal languages
- A note on undecidable properties of formal languages
- A weak version of the Blum, Shub, and Smale model
- An infinite hierarchy of intersections of context-free languages
- Analog computation via neural networks
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Computability with low-dimensional dynamical systems
- Computing over the reals with addition and order
- Generalized one-sided shifts and maps of the interval
- Generalized shifts: unpredictability and undecidability in dynamical systems
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3961009 (Why is no real title available?)
- scientific article; zbMATH DE number 4039867 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263207 (Why is no real title available?)
- scientific article; zbMATH DE number 710382 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Lower Bounds for Approximation by Nonlinear Manifolds
- New Real-Time Simulations of Multihead Tape Units
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On digital nondeterminism
- QRT FIFO automata, breadth-first grammars and their relations
- Quasi-realtime languages
- Real number models under various sets of operations
- Real-Time Definable Languages
- The Rational Index: A Complexity Measure for Languages
Cited in
(16)- A new conceptual framework for analog computation
- What is a universal computing machine?
- Quantum automata and quantum grammars
- Analog computation with dynamical systems
- An analog characterization of the Grzegorczyk hierarchy
- Simple recurrent networks learn context-free and context-sensitive languages by counting.
- A system of dactyl language elements recognition
- Stack-like and queue-like dynamics in recurrent neural networks
- RECOGNITION OF AN APPROXIMATE OCCURRENCE OF WORDS ON A TURING MACHINE IN REAL TIME
- Estimates of the operating time of stable iterative, language-modeling, and recognition systems
- scientific article; zbMATH DE number 1008368 (Why is no real title available?)
- Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations
- Universal neural field computation
- Inverse problems in dynamic cognitive modeling
- Elman Backpropagation as Reinforcement for Simple Recurrent Networks
- Iteration, inequalities, and differentiability in analog computers
This page was built for publication: Dynamical recognizers: real-time language recognition by analog computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129007)