Loading…
Forgetting 1-limited automata
We introduce and investigate forgetting 1-limited automata, which are single-tape Turing machines that, when visiting a cell for the first time, replace the input symbol in it by a fixed symbol, so forgetting the original contents. These devices have the same computational power as finite automata,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/24894714.v1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|