Imagen de Portada

Universality in computable dynamical systems: Old and new

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	González-Prieto, Ángel, Miranda, Eva, Peralta-Salas, Daniel
Formato:	Preprint
Publicado:	2025
Materias:	Dynamical Systems Formal Languages and Automata Theory Differential Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Topological Kleene Field Theories as a model of computation
por: González-Prieto, Ángel, et al.
Publicado: (2025)

Rule-based Generation of de Bruijn Sequences: Memory and Learning
por: Muñoz, Francisco J., et al.
Publicado: (2025)

Cellular automata can really solve the parity problem
por: Wolnik, Barbara, et al.
Publicado: (2025)

Decidable problems in substitution shifts
por: Béal, Marie-Pierre, et al.
Publicado: (2021)

Sequential densities of rational languages
por: Gorman, Alexi Block, et al.
Publicado: (2026)

On a Constraint on Invariant Measures of Certain Cellular Automata
por: Tal, Matan
Publicado: (2026)

The complexity of finite smooth words over binary alphabets
por: Cassaigne, Julien, et al.
Publicado: (2026)

Connections between the minimal neighborhood and the activity value of cellular automata
por: Castillo-Ramirez, Alonso, et al.
Publicado: (2025)

Escape of mass of the Thue-Morse sequence
por: Nesharim, Erez, et al.
Publicado: (2025)

Graph and wreath products of cellular automata
por: Salo, Ville
Publicado: (2020)

Limit dynamics of elementary cellular automaton 18
por: Sabrié, Hervé, et al.
Publicado: (2023)

Topological transitivity of group cellular automata is decidable
por: Castronuovo, Niccolò, et al.
Publicado: (2026)

On the order of lazy cellular automata
por: Alcalá-Arroyo, Edgar, et al.
Publicado: (2025)

A categorical framework for cellular automata
por: Castillo-Ramirez, A., et al.
Publicado: (2026)

On Countable SFT Covers of Sparse Multidimensional Shift Spaces
por: Törmä, Ilkka
Publicado: (2024)

Finite Automata Encoding Piecewise Polynomials
por: Berdinsky, Dmitry, et al.
Publicado: (2021)

Word problems and embedding-obstructions in cellular automata groups on groups
por: Salo, Ville
Publicado: (2025)

Over-approximation of weakly-hard constraints for control systems verification (Extended)
por: de Maeyer, Rieke, et al.
Publicado: (2026)

Computational Dynamical Systems
por: Cotler, Jordan, et al.
Publicado: (2024)

Multiband linear cellular automata and endomorphisms of algebraic vector groups
por: Byszewski, Jakub, et al.
Publicado: (2022)

Universally Wheeler Languages
por: Becker, Ruben, et al.
Publicado: (2025)

Universality Frontier for Asynchronous Cellular Automata
por: Baburin, Ivan, et al.
Publicado: (2025)

New Insights into the Decidability of Opacity in Timed Automata
por: Deng, Weilin, et al.
Publicado: (2025)

On the Complexity of the Secret Protection Problem for Discrete-Event Systems
por: Masopust, Tomáš, et al.
Publicado: (2025)

Secret Protection in Labeled Petri Nets
por: Haar, Stefan, et al.
Publicado: (2025)

Overview of Controllability Definitions in Supervisory Control Theory
por: Keiren, Jeroen J. A., et al.
Publicado: (2025)

On the Completeness and Ordering of Path-Complete Barrier Functions
por: Anand, Mahathi, et al.
Publicado: (2025)

Opacity in Discrete Event Systems: A Perspective and Overview
por: Yin, Xiang
Publicado: (2026)

Switching Controller Synthesis for Hybrid Systems Against STL Formulas
por: Su, Han, et al.
Publicado: (2024)

Data-Driven Abstractions for Control Systems via Random Exploration
por: Coppola, Rudi, et al.
Publicado: (2024)

Hyper parametric timed CTL
por: Waga, Masaki, et al.
Publicado: (2024)

Opacity Enforcement by Edit Functions Under Incomparable Observations
por: Duan, Wei, et al.
Publicado: (2024)

Co-Buchi Barrier Certificates for Discrete-time Dynamical Systems
por: Murali, Vishnu, et al.
Publicado: (2023)

Interpolation-Inspired Closure Certificates
por: Oumer, Mohammed Adib, et al.
Publicado: (2026)

On Algorithms verifying Initial-and-Final-State Opacity: Complexity, Special Cases, and Comparison
por: Masopust, Tomáš, et al.
Publicado: (2024)

iCPS-DL: A Description Language for Autonomic Industrial Cyber-Physical Systems
por: Kouzapas, Dimitrios, et al.
Publicado: (2024)

Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
por: Delicaris, Joanna, et al.
Publicado: (2026)

Decoupled Planning for Multiple Omega-Regular Objectives
por: Avni, Guy, et al.
Publicado: (2026)

Supervisory Control Theory with Event Forcing
por: Reniers, Michel, et al.
Publicado: (2024)

The theory of reachability in trace-pushdown systems
por: Kuske, Dietrich
Publicado: (2025)