Automata with modulo counters and nondeterministic counter bounds
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are two-way one-head automata that comprise a constant number of modulo counters, where the counter bounds are nondeterministically guessed, and this is the only element of nondeterminism. NBMCA are tail...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/10358 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|