Restarting Automata Extensions and Generalizations /
A restarting automaton consists of a finite-state control, a flexible tape with end-of-tape markers that initially contains the input, and a read-write window of a fixed finite size. The objective here is to collect the many results that have been obtained on the various types of restarting automata...
Сохранить в:
| Главный автор: | |
|---|---|
| Соавтор: | |
| Формат: | Электронный ресурс eКнига |
| Язык: | английский |
| Опубликовано: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Редактирование: | 1st ed. 2025. |
| Серии: | Theory and Applications of Computability, In cooperation with the Association Computability in Europe,
|
| Предметы: | |
| Online-ссылка: | https://doi.org/10.1007/978-3-031-78701-0 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
Оглавление:
- Introduction
- Systems of Restarting Automata
- Restarting Automata with Output
- Restarting Automata for Picture Languages
- Restarting Tree Automata
- Appendix A: List of Open Problems
- Appendix B: List of Example Languages.