Detecting and explaining (in)equivalence of context-free grammars
<|reference_start|>Detecting and explaining (in)equivalence of context-free grammars: We propose a scalable framework for deciding, proving, and explaining (in)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems. Even though the equivalence problem for context-free languages is undecidable in general, the framework is able to handle a large portion of these datasets. It introduces and combines techniques from several areas, such as an abstract grammar transformation language to identify equivalent grammars as well as sufficiently similar inequivalent grammars, theory-based comparison algorithms for a large class of context-free languages, and a graph-theory-inspired grammar canonization that allows to efficiently identify isomorphic grammars.<|reference_end|>
@article{schmellenkamp2024detecting,
    title={Detecting and explaining (in)equivalence of context-free grammars},
    author={Marko Schmellenkamp and Thomas Zeume and Sven Argo and Sandra Kiefer
  and Cedric Siems and Fynn Stebel},
    journal={arXiv preprint arXiv:2407.18220},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.18220},
    primaryClass={cs.FL cs.CY cs.PL}
}