On a reachability set of automaton 3-counter machines
In this paper we prove the existence of automaton 3-counter machines which have non-semilinear reachability sets.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2009-09-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/953 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|