Once-marking and always-marking 1-limited automata
Single-tape nondeterministic Turing machines that are allowed to replace the symbol in each tape cell only when it is scanned for the first time are also known as [Formula: see text]-limited automata. These devices characterize, exactly as finite automata, the class of regular languages. However, th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Article |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/30597230.v1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|