A Note on a Unifying Proof of the Undecidability of Several Diagrammatic Properties of Term Rewriting Systems
AuthID
P-00S-6SS
P-00S-6SS
© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service