Decision problems for Clark-congruential languages
Computation and Language
2023-02-03 v2 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.1805.04402,
title = {Decision problems for Clark-congruential languages},
author = {Makoto Kanazawa and Tobias Kappé},
journal= {arXiv preprint arXiv:1805.04402},
year = {2023}
}
Comments
Version 2 incorporates revisions prompted by the comments of anonymous referees at ICGI and LearnAut