Image de couverture de livre

Universality in computable dynamical systems: Old and new

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	González-Prieto, Ángel, Miranda, Eva, Peralta-Salas, Daniel
Format:	Preprint
Publié:	2025
Sujets:	Dynamical Systems Formal Languages and Automata Theory Differential Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Topological Kleene Field Theories as a model of computation
par: González-Prieto, Ángel, et autres
Publié: (2025)

Rule-based Generation of de Bruijn Sequences: Memory and Learning
par: Muñoz, Francisco J., et autres
Publié: (2025)

Cellular automata can really solve the parity problem
par: Wolnik, Barbara, et autres
Publié: (2025)

Decidable problems in substitution shifts
par: Béal, Marie-Pierre, et autres
Publié: (2021)

Sequential densities of rational languages
par: Gorman, Alexi Block, et autres
Publié: (2026)

On a Constraint on Invariant Measures of Certain Cellular Automata
par: Tal, Matan
Publié: (2026)

The complexity of finite smooth words over binary alphabets
par: Cassaigne, Julien, et autres
Publié: (2026)

Connections between the minimal neighborhood and the activity value of cellular automata
par: Castillo-Ramirez, Alonso, et autres
Publié: (2025)

Escape of mass of the Thue-Morse sequence
par: Nesharim, Erez, et autres
Publié: (2025)

Graph and wreath products of cellular automata
par: Salo, Ville
Publié: (2020)

Limit dynamics of elementary cellular automaton 18
par: Sabrié, Hervé, et autres
Publié: (2023)

Topological transitivity of group cellular automata is decidable
par: Castronuovo, Niccolò, et autres
Publié: (2026)

On the order of lazy cellular automata
par: Alcalá-Arroyo, Edgar, et autres
Publié: (2025)

A categorical framework for cellular automata
par: Castillo-Ramirez, A., et autres
Publié: (2026)

On Countable SFT Covers of Sparse Multidimensional Shift Spaces
par: Törmä, Ilkka
Publié: (2024)

Finite Automata Encoding Piecewise Polynomials
par: Berdinsky, Dmitry, et autres
Publié: (2021)

Word problems and embedding-obstructions in cellular automata groups on groups
par: Salo, Ville
Publié: (2025)

Over-approximation of weakly-hard constraints for control systems verification (Extended)
par: de Maeyer, Rieke, et autres
Publié: (2026)

Computational Dynamical Systems
par: Cotler, Jordan, et autres
Publié: (2024)

Multiband linear cellular automata and endomorphisms of algebraic vector groups
par: Byszewski, Jakub, et autres
Publié: (2022)

Universally Wheeler Languages
par: Becker, Ruben, et autres
Publié: (2025)

Universality Frontier for Asynchronous Cellular Automata
par: Baburin, Ivan, et autres
Publié: (2025)

New Insights into the Decidability of Opacity in Timed Automata
par: Deng, Weilin, et autres
Publié: (2025)

On the Complexity of the Secret Protection Problem for Discrete-Event Systems
par: Masopust, Tomáš, et autres
Publié: (2025)

Secret Protection in Labeled Petri Nets
par: Haar, Stefan, et autres
Publié: (2025)

Overview of Controllability Definitions in Supervisory Control Theory
par: Keiren, Jeroen J. A., et autres
Publié: (2025)

On the Completeness and Ordering of Path-Complete Barrier Functions
par: Anand, Mahathi, et autres
Publié: (2025)

Opacity in Discrete Event Systems: A Perspective and Overview
par: Yin, Xiang
Publié: (2026)

Switching Controller Synthesis for Hybrid Systems Against STL Formulas
par: Su, Han, et autres
Publié: (2024)

Data-Driven Abstractions for Control Systems via Random Exploration
par: Coppola, Rudi, et autres
Publié: (2024)

Hyper parametric timed CTL
par: Waga, Masaki, et autres
Publié: (2024)

Opacity Enforcement by Edit Functions Under Incomparable Observations
par: Duan, Wei, et autres
Publié: (2024)

Co-Buchi Barrier Certificates for Discrete-time Dynamical Systems
par: Murali, Vishnu, et autres
Publié: (2023)

Interpolation-Inspired Closure Certificates
par: Oumer, Mohammed Adib, et autres
Publié: (2026)

On Algorithms verifying Initial-and-Final-State Opacity: Complexity, Special Cases, and Comparison
par: Masopust, Tomáš, et autres
Publié: (2024)

iCPS-DL: A Description Language for Autonomic Industrial Cyber-Physical Systems
par: Kouzapas, Dimitrios, et autres
Publié: (2024)

Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
par: Delicaris, Joanna, et autres
Publié: (2026)

Decoupled Planning for Multiple Omega-Regular Objectives
par: Avni, Guy, et autres
Publié: (2026)

Supervisory Control Theory with Event Forcing
par: Reniers, Michel, et autres
Publié: (2024)

The theory of reachability in trace-pushdown systems
par: Kuske, Dietrich
Publié: (2025)