A common question when studying a class of context-free grammars (CFGs) is whether equivalence is decidable within this class. We answer this question ...

May 11, 2018 · Abstract:A common question when studying a class of context-free grammars is whether equivalence is decidable within this class.

Abstract. A common question when studying a class of context-free grammars (CFGs) is whether equivalence is decidable within this class.

Definition (Informal). A grammar is Clark-congruential (CC) if words derived from the same symbol are syntactically congruent for its language.

A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively ...

Abstract. A common question when studying a class of context-free grammars (CFGs) is whether equivalence is decidable within this class.

A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively ...

A common question when studying a class of context-free grammars (CFGs) is whether equivalence is decidable within this class. We answer this question ...

Aug 21, 2018 · Abstract. A common question when studying a class of context-free grammars (CFGs) is whether equivalence is decidable within this class.

TL;DR: In this article, it was shown that equivalence is decidable for the class of Clark-congruential grammars, and that the problem of checking whether a ...