Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
21
search results - page 5 / 5
»
Completion for Rewriting Modulo a Congruence
Sort
relevance
views
votes
recent
update
View
thumb
title
123
Voted
RTA
2010
Springer
169
views
Theoretical Computer Science
»
more
RTA 2010
»
Computing Critical Pairs in 2-Dimensional Rewriting Systems
15 years 7 months ago
Download
www.pps.jussieu.fr
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
claim paper
Read More »
« Prev
« First
page 5 / 5
Last »
Next »