Cover Image

Decidable problems in substitution shifts

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Béal, Marie-Pierre, Perrin, Dominique, Restivo, Antonio
Format:	Preprint
Published:	2021
Subjects:	Dynamical Systems Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

One-sided Hom shifts
by: Béal, Marie-Pierre, et al.
Published: (2025)

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

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

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

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

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

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

Graph and wreath products of cellular automata
by: Salo, Ville
Published: (2020)

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

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

Universally Wheeler Languages
by: Becker, Ruben, et al.
Published: (2025)

Deciding Subtyping for Asynchronous Multiparty Sessions
by: Li, Elaine, et al.
Published: (2024)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

Universality in computable dynamical systems: Old and new
by: González-Prieto, Ángel, et al.
Published: (2025)

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

On Decidability Timed Automata with 2 Parametric Clocks
by: Bersani, Marcello M., et al.
Published: (2025)

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

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

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

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

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

Deciding the synthesis problem for hybrid games through bisimulation
by: Dima, Catalin, et al.
Published: (2024)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
by: Roop, Partha, et al.
Published: (2026)

Computational Dynamical Systems
by: Cotler, Jordan, et al.
Published: (2024)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Decidability and Characterization of Expansivity for Group Cellular Automata
by: Castronuovo, Niccolo', et al.
Published: (2025)

One-clock synthesis problems
by: Lasota, Sławomir, et al.
Published: (2026)

Conway's cosmological theorem and automata theory
by: Lairez, Pierre, et al.
Published: (2024)

The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

A Divide and Conquer Algorithm for Deciding Group Cellular Automata Dynamics
by: Castronuovo, Niccolo', et al.
Published: (2025)

Execution-time opacity problems in one-clock parametric timed automata
by: André, Étienne, et al.
Published: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Checking and producing word attractors
by: Béal, Marie-Pierre, et al.
Published: (2025)

Modelling and Analysis of Supply Chains using Product Time Petri Nets
by: Lubat, Eric, et al.
Published: (2026)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

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