International Journal of Pattern Recognition and Artificial Intelligence · 1995 · 21 citations · 0 references
ComputingComputer ScienceAlgorithmsAbstract Syntax TreesGrammarDecidability ProblemsEmptiness ProblemUndecidability
The emptiness problem for non-overlapping Basic puzzle grammars is shown to be decidable. An alternate proof of the decidability of the non-overlapping feature for basic puzzle grammars is given. Hierarchy among the various classes of puzzle languages is also established.