A Uniform Framework for Language Inclusion Problems

Autor:	Doveri, Kyveli, Ganty, Pierre, Weil-Kennedy, Chana
Rok vydání:	2024
Předmět:	Computer Science - Formal Languages and Automata Theory Computer Science - Logic in Computer Science
Druh dokumentu:	Working Paper
DOI:	10.1007/978-3-031-56222-8_9
Popis:	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. Comment: 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"
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2404.09862 Zobrazit plný text záznamu View this record from Arxiv