On the Efficient Representation of an Unbounded Resource with the Aid of One-Counter Circuits
A class of infinite-state automata with a simple periodic behaviour and a convenient graphical representation is studied. A positive one-counter circuit is defined as a strongly connected one-counter net (one-counter nondeterministic finite automata without zero-testing) with at least one positive c...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2013-04-01
|
| Series: | Modelirovanie i Analiz Informacionnyh Sistem |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/212 |