Showing papers by "Rani Siromoney published in 1995"
TL;DR: The emptiness problem for non-overlapping Basic puzzle grammars is shown to be decidable and Hierarchy among the various classes of puzzle languages is established.
Abstract: 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
22 citations