Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Partial order infinitary term rewriting and Böhm trees
Patrick Bahr
Department of Computer Science
11
Citations (Scopus)
1118
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Partial order infinitary term rewriting and Böhm trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Alternatives
7%
Compression
12%
Corollary
9%
Equate
17%
Lemma
19%
Metric
48%
Model
16%
Partial Order
73%
Reachability
52%
Roots
9%
Strong Convergence
11%
Term
13%
Term Rewriting
100%
Term Rewriting Systems
31%