Cover Image

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dennunzio, Alberto, Gadouleau, Maximilien, Mariot, Luca
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A study on the composition of elementary cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2023)

Idempotent cellular automata and their natural order
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

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

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

Nondeterminism makes unary 1-limited automata concise
by: Guillon, Bruno, et al.
Published: (2025)

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

$2$-word-$π$-representable Graphs
by: Adamson, Duncan, et al.
Published: (2026)

Half-flips are 5-avoidable
by: Ochem, Pascal
Published: (2026)

Jumbled Scattered Factors
by: Fleischmann, Pamela, et al.
Published: (2025)

Synchronization of strongly connected partial DFAs and prefix codes
by: Berlinkov, Mikhail V., et al.
Published: (2021)

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
by: Bonizzoni, Paola, et al.
Published: (2024)

Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022)

Word-Representable Graphs and Locality of Words
by: Böll, Philipp, et al.
Published: (2025)

Maximal 2-dimensional binary words of bounded degree
by: Massé, Alexandre Blondin, et al.
Published: (2025)

On a sequence of Kimberling and its relationship to the Tribonacci word
by: Dvořáková, Lubomíra, et al.
Published: (2025)

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

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

Database-assisted automata learning
by: Walinga, Hielke, et al.
Published: (2024)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Cerny type automata and rank conjecture
by: Rystsov, Igor
Published: (2025)

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

Banach density of generated languages: Dichotomies in topology and dimension
by: Kleinberg, Jon, et al.
Published: (2026)

Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)

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

The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)

Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)

Diagnosability of labeled $\mathfrak{D_p}$ automata
by: Zhang, Kuize, et al.
Published: (2021)

Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, et al.
Published: (2026)

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

Exact descriptional complexity of determinization of input-driven pushdown automata
by: Martynova, Olga
Published: (2024)

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

Soft state reduction of fuzzy automata over residuated lattices
by: Nguyen, Linh Anh, et al.
Published: (2025)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Cluster automata
by: Kornai, András
Published: (2025)

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)

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)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)