2000 character limit reached
Decision problems for Clark-congruential languages (1805.04402v2)
Published 11 May 2018 in cs.CL and cs.FL
Abstract: A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical inference. We also consider the problem of checking whether a given CFG is Clark-congruential, and show that it is decidable given that the CFG is a DCFG.