東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Restarting automata = extensions and generalizations /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Restarting automata/ by Friedrich Otto.
Reminder of title:	extensions and generalizations /
Author:	Otto, Friedrich.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xvi, 313 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Machine theory. -
Online resource:	https://doi.org/10.1007/978-3-031-78701-0
ISBN:	9783031787010

Restarting automata = extensions and generalizations /
Otto, Friedrich.

Restarting automataextensions and generalizations /[electronic resource] :by Friedrich Otto. - Cham :Springer Nature Switzerland :2025. - xvi, 313 p. :ill., digital ;24 cm. - Theory and applications of computability. - Theory and applications of computability..

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.

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.

ISBN: 9783031787010

Standard No.: 10.1007/978-3-031-78701-0doiSubjects--Topical Terms:

523249
Machine theory.

LC Class. No.: QA267

Dewey Class. No.: 511.35

Restarting automata = extensions and generalizations /
LDR:02671nmm a2200337 a 4500 001 2408609
003 DE-He213
005 20250315214553.0
006 m d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031787010 $q (electronic bk.)
020 $a 9783031787003 $q (paper)
024 7 $a 10.1007/978-3-031-78701-0 $2 doi
035 $a 978-3-031-78701-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.35 $2 23
090 $a QA267 $b .O9 2025
100 1 $a Otto, Friedrich. $3 923759
245 1 0 $a Restarting automata $h [electronic resource] : $b extensions and generalizations / $c by Friedrich Otto.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xvi, 313 p. : $b ill., digital ; $c 24 cm.
490 1 $a Theory and applications of computability
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 Machine theory. $3 523249
650 0 $a Formal methods (Computer science) $3 882407
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Formal Languages and Automata Theory. $3 3592087
650 2 4 $a Computational Linguistics. $3 893900
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Theory and applications of computability. $3 2199731
856 4 0 $u https://doi.org/10.1007/978-3-031-78701-0
950 $a Computer Science (SpringerNature-11645)