Beyond Pattern Completeness: Deciding Quasi-Reducibility in Left-Linear TRSs
Fuente:
Zenodo
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Recurso digital |
| Sprache: | Englisch |
| Veröffentlicht: |
Zenodo
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866902095828877312 |
|---|---|
| author | Koves, Daniel |
| author_facet | Koves, Daniel |
| contents | |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17314081 |
| institution | Zenodo |
| language | eng |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Beyond Pattern Completeness: Deciding Quasi-Reducibility in Left-Linear TRSs Koves, Daniel Computer Science Theoretical Computer Science Term Rewriting |
| title | Beyond Pattern Completeness: Deciding Quasi-Reducibility in Left-Linear TRSs |
| topic | Computer Science Theoretical Computer Science Term Rewriting |
| url | https://doi.org/10.5281/zenodo.17314081 |