Sweep complexity revisited
We study the sweep complexity of DFA in one-way jumping mode answering several questions posed earlier. This measure is the number of times in the worst case that such machines have to return to the beginning of their input after having skipped some of the symbols. The class of languages accepted by...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/24865623.v1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|