Exact Codimension-Two Reaching Thresholds for Binary Completely Reachable Automata

Preprint proving the exact worst-case reaching threshold of (n-2)-subsets in n-state binary completely reachable automata for every n >= 4, with an exhaustive finite certificate for the n=8 boundary case.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-30
DOI
https://doi.org/10.5281/zenodo.23050726
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Exact Codimension-Two Reaching Thresholds for Binary Completely Reachable Automata

Ryutaro Yonezu
Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
preprint

Exact Codimension-Two Reaching Thresholds for Binary Completely Reachable Automata

Ryutaro Yonezu
preprint en

Abstract

Preprint proving the exact worst-case reaching threshold of (n-2)-subsets in n-state binary completely reachable automata for every n >= 4, with an exhaustive finite certificate for the n=8 boundary case.

Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Exact Codimension-Two Reaching Thresholds for Binary Completely Reachable Automata — Ryutaro Yonezu · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS