A Uniform Framework for Language Inclusion Problems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929314195308544 |
|---|---|
| author | Doveri, Kyveli Ganty, Pierre Weil-Kennedy, Chana |
| author_facet | Doveri, Kyveli Ganty, Pierre Weil-Kennedy, Chana |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_09862 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Uniform Framework for Language Inclusion Problems Doveri, Kyveli Ganty, Pierre Weil-Kennedy, Chana Formal Languages and Automata Theory Logic in Computer Science 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. |
| title | A Uniform Framework for Language Inclusion Problems |
| topic | Formal Languages and Automata Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2404.09862 |