# Decision problems for Clark-congruential languages

arXiv: https://arxiv.org/abs/1805.04402 · HTML: https://mlsanity.com/paper/1805.04402/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 May 2018.

## Built on by (most cited first, 1 of 1)

- [The Value of Finite Observation in Positive-Data Learning of Multiple Context-Free Languages](https://mlsanity.com/paper/2605.11644/) (2026)

## Abstract (arXiv)

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.