A Uniform Framework for Language Inclusion Problems
<|reference_start|>A Uniform Framework for Language Inclusion Problems: We present a uniform approach for solving language inclusion problems. Our approach relies on a least fixpoint characterization and a quasiorder to compare words of the "smaller" language, reducing the inclusion check to a finite number of membership queries in the "larger" language. We present our approach in detail on the case of inclusion of a context-free language given by a grammar into a regular language. We then explore other inclusion problems and discuss how to apply our approach.<|reference_end|>
@article{doveri2024a,
    title={A Uniform Framework for Language Inclusion Problems},
    author={Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy},
    journal={arXiv preprint arXiv:2404.09862},
    year={2024},
    doi={10.1007/978-3-031-56222-8_9},
    archivePrefix={arXiv},
    eprint={2404.09862},
    primaryClass={cs.FL cs.LO}
}