Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328868 | Electronic Notes in Theoretical Computer Science | 2005 | 17 Pages |
Abstract
We present a complete classification of reachability decision problems for these systems into decid- able or undecidable.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ranko LaziÄ,