Optimize the reversibility-graph-based algorithm for FCA

Determine whether further algorithmic optimizations exist for the reversibility computation method based on the reversibility graph and circuit graph that reduce unnecessary computations and improve the time and/or space complexity beyond the current bounds O(s^m V + s V l + V l^2).

Background

The authors propose an algorithm that constructs a reversibility graph (RG), enumerates circuits, and builds a circuit graph (CG) to compute the reversibility sequence for any one-dimensional finite cellular automaton under common boundary conditions. The overall complexity is O(s^m V + s V l + V l^2), where s is the number of states, V the number of RG vertices, and l the number of circuits.

They explicitly raise whether unnecessary computations can be reduced further, indicating potential room for theoretical or practical improvements in pruning, data structures, or circuit enumeration.