Skip to main content
Log In
Log in
New user? Click here to register.
Have you forgotten your password?
Communities & Collections
All of DSpace
Statistics
Home
Collections Radboud University
Academic research output
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
Loading...
Files
Access status:
Embargo until 2233-03-22
,
Primary
35291.pdf
(357.44 KB)
Date
2007
Authors
Geser, A.
Hofbauer, D.
Waldmann, J.
Zantema, H. Hans
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Abstract
Description
Keywords
Citation
URI
https://hdl.handle.net/2066/35291
Collections
Academic research output
Endorsement
Review
Supplemented By
Referenced By
Full item page