Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Beyond Pattern Completeness: Deciding Quasi-Reducibility in Left-Linear TRSs
Beyond Pattern Completeness: Deciding Quasi-Reducibility in Left-Linear TRSs
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Koves, Daniel
Format:
Recurso digital
Language:
English
Published:
Zenodo
2025
Subjects:
Computer Science
Theoretical Computer Science
Term Rewriting
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://doi.org/10.5281/zenodo.17314081
Similar Items
GρπF: Graphical ρπ Framework
by: Cailler, Julie, et al.
Published: (2026)
Chapter Le Carte: al di là del genere
by: Cheli, Francesca
Published: (2025)
When lies become the truth: rewriting the conquest of Mexico in Carlos Fuentes's novella, The Two Shores
by: John Robert Schmitz
Published: (2006)
Artisanal inventiveness. The dynamics of rewriting in the plays of northern Italian puppeteers (19th-20th century)
by: Di Fazio, Francesca
Published: (2024)
ROMEO AND JULIET’S REWRITING IN THE WALT DISNEY’S ANIMATED MOVIE POCAHONTAS: ADAPTATION STUDIES, COMPARATIVE LITERATURE AND THEORY OF INTERTEXTUALITY
by: Tiago Marques Luiz
Published: (2023)