Cargando…
Probabilistic Deterministic Finite Automata and Recurrent Networks, Revisited
Reservoir computers (RCs) and recurrent neural networks (RNNs) can mimic any finite-state automaton in theory, and some workers demonstrated that this can hold in practice. We test the capability of generalized linear models, RCs, and Long Short-Term Memory (LSTM) RNN architectures to predict the st...
Autores principales: | Marzen, Sarah E., Crutchfield, James P. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8774624/ https://www.ncbi.nlm.nih.gov/pubmed/35052116 http://dx.doi.org/10.3390/e24010090 |
Ejemplares similares
-
Limited Two-Way Deterministic Finite Automata with Advice
por: Uçan, Ahmet Bilal
Publicado: (2020) -
Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information
por: Liu, Desheng, et al.
Publicado: (2016) -
Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study †
por: Tîrnăucă, Cristina, et al.
Publicado: (2016) -
Deterministic networks for probabilistic computing
por: Jordan, Jakob, et al.
Publicado: (2019) -
Finite automata
por: Lawson, Mark V
Publicado: (2003)