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
140
click to vote
MFCS
2010
Springer
152
views
Theoretical Computer Science
»
more
MFCS 2010
»
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
15 years 1 months ago
Download
www.lsv.ens-cachan.fr
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
claim paper
Read More »