Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
In- formation Processing Letters97(5), 181–185 (2006)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
An ILP formulation for Evolomino encodes puzzle rules as linear constraints and supports generation of unique instances, with solver tests up to 18x18 grids.
citing papers explorer
-
Visibly Recursive Automata
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
-
An Integer Linear Programming Model for the Evolomino Puzzle
An ILP formulation for Evolomino encodes puzzle rules as linear constraints and supports generation of unique instances, with solver tests up to 18x18 grids.