Analysis of Dehn's algorithm by critical pairs

Authors:
P. Le Chenadec
Affiliations:
INRIA, Rocquencourt, Le Chesnay Cedex, France
Venue:
Theoretical Computer Science
Year:
1987

Citing 0
Cited 1

Infinite families of finite string rewriting systems and their confluence

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning

Quantified Score

Hi-index	5.23

Visualization

Abstract