Justin Cai

collaborators

2 papers

cs.CC2021

Computational complexity of problems for deterministic presentations of sofic shifts

Justin Cai, Rafael Frongillo

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complex…

math.DS2020

Automorphism Groups of Endomorphisms of $P^{1} (F ˉ_{p})$

Julia Cai, Benjamin Hutz, Leo Mayer +1

For any algebraically closed field $K$ and any endomorphism $f$ of $P^{1} (K)$ of degree at least 2, the automorphisms of $f$ are the Möbius transformations that commute with…

Computational complexity of problems for deterministic presentations of sofic shifts

Automorphism Groups of Endomorphisms of P1(Fˉp​)

Automorphism Groups of Endomorphisms of $P^{1} (F ˉ_{p})$