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...
Guardat en:
| Autor principal: | |
|---|---|
| Autor corporatiu: | |
| Format: | Electrònic eBook |
| Idioma: | anglès |
| Publicat: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Edició: | 1st ed. 2025. |
| Col·lecció: | Theory and Applications of Computability, In cooperation with the Association Computability in Europe,
|
| Matèries: | |
| Accés en línia: | https://doi.org/10.1007/978-3-031-78701-0 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-78701-0 | ||
| 003 | DE-He213 | ||
| 005 | 20260706115704.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 250315s2025 sz | s |||| 0|eng d | ||
| 020 | |a 9783031787010 |9 978-3-031-78701-0 | ||
| 024 | 7 | |a 10.1007/978-3-031-78701-0 |2 doi | |
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Otto, Friedrich. |e author. |0 (orcid)0009-0002-9760-5462 |1 https://orcid.org/0009-0002-9760-5462 |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Restarting Automata |h [electronic resource] : |b Extensions and Generalizations / |c by Friedrich Otto. |
| 250 | |a 1st ed. 2025. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2025. | |
| 300 | |a XVI, 313 p. 28 illus. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Theory and Applications of Computability, In cooperation with the Association Computability in Europe, |x 2190-6203 | |
| 505 | 0 | |a 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. | |
| 520 | |a 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 in one place and to present them in a uniform and systematic way. In this volume, the expressive capacity of the various systems of restarting automata is studied, the relations computed by certain types of restarting automata with output are investigated, and the restarting automaton is extended to models that process pictures and trees. Among the book’s topics and features: Extends the restarting automaton to cooperating distributed and parallel communicating systems of restarting automata Presents restarting automata with output, which compute certain binary relations Extends the restarting automaton to automata that accept picture languages and tree languages Provides a text accessible to advanced undergraduate and graduate students This title is directly tied to the separate Springer volume, Restarting Automata: The Standard Type of Restarting Automaton and Its Variants. Together, these comprehensive monographs may serve as references for researchers, guides to the literature on restarting automata, and as textbooks for an advanced undergraduate or graduate course in formal language and automata theory. . | ||
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Machine theory. | |
| 650 | 0 | |a Computational linguistics. | |
| 650 | 1 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Formal Languages and Automata Theory. |
| 650 | 2 | 4 | |a Computational Linguistics. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031787003 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031787027 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031787034 |
| 830 | 0 | |a Theory and Applications of Computability, In cooperation with the Association Computability in Europe, |x 2190-6203 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-78701-0 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-238 | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||
| 950 | |a Focus Bundle Foundational Computer Science (SpringerNature-85408) | ||