We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.FL

Change to browse by:

References & Citations

DBLP - CS Bibliography

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Formal Languages and Automata Theory

Title: A Uniform Framework for Language Inclusion Problems

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.
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"
Subjects: Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO)
DOI: 10.1007/978-3-031-56222-8_9
Cite as: arXiv:2404.09862 [cs.FL]
  (or arXiv:2404.09862v1 [cs.FL] for this version)

Submission history

From: Chana Weil-Kennedy [view email]
[v1] Mon, 15 Apr 2024 15:17:51 GMT (26kb,D)

Link back to: arXiv, form interface, contact.