Highlights 2013
Strong simulation for one counter nets is PSPACE-complete
Abstract
A one counter net is a one counter automaton without possibility of testing 0 value. We proved that solving the simulation problem for one counter nets is P-SPACE complete. 15: 15 15: 45 Coffee break
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- Highlights of Logic, Games and Automata
- Archive span
- 2013-2025
- Indexed papers
- 1236
- Paper id
- 294891592368588753