Restarting Automata The Standard Type of Restarting Automaton and Its Variants /
In this unique volume, the expressive capacity of the various types of restarting automata is studied, and the resulting classes of languages are compared to each other and to the classes of an extended Chomsky hierarchy. A restarting automaton consists of a finite-state control, a flexible tape wit...
Gardado en:
| Autor Principal: | |
|---|---|
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | inglés |
| Publicado: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Edición: | 1st ed. 2025. |
| Series: | Theory and Applications of Computability, In cooperation with the Association Computability in Europe,
|
| Subjects: | |
| Acceso en liña: | https://doi.org/10.1007/978-3-031-70094-1 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
Table of Contents:
- Introduction
- Analysis by Reduction
- The Restarting Automaton and Its Parameters
- Descriptional Complexity
- Learnability for Restarting Automata
- Appendix A: List of Open Problems
- Appendix B: List of Example Languages.