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
461
search results - page 93 / 93
»
Letters
Sort
relevance
views
votes
recent
update
View
thumb
title
112
Voted
STACS
2007
Springer
116
views
Theoretical Computer Science
»
more
STACS 2007
»
Reachability in Unions of Commutative Rewriting Systems Is Decidable
15 years 8 months ago
Download
www.mimuw.edu.pl
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
claim paper
Read More »
« Prev
« First
page 93 / 93
Last »
Next »