A Uniform Framework for Language Inclusion Problems
Formal Languages and Automata Theory
2024-04-16 v1 Logic in Computer Science
Abstract
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.
Keywords
Cite
@article{arxiv.2404.09862,
title = {A Uniform Framework for Language Inclusion Problems},
author = {Kyveli Doveri and Pierre Ganty and Chana Weil-Kennedy},
journal= {arXiv preprint arXiv:2404.09862},
year = {2024}
}
Comments
Published as part of the Festschrift for Javier Esparza "Taming the Infinities of Concurrency: Essays Dedicated to Javier Esparza on the Occasion of His 60th Birthday"