國立虎尾科技大學 |

登入

回首頁

Restarting automata = the standard type of restarting automaton and its variants /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Restarting automata/ by Friedrich Otto.
其他題名:	the standard type of restarting automaton and its variants /
作者:	Otto, Friedrich.
出版者:	Cham :Springer Nature Switzerland : : 2025.,
面頁冊數:	viii, 409 p. :ill., digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Computational Linguistics. -
電子資源:	https://doi.org/10.1007/978-3-031-70094-1
ISBN:	9783031700941

Restarting automata = the standard type of restarting automaton and its variants /
Otto, Friedrich.

Restarting automatathe standard type of restarting automaton and its variants /[electronic resource] :by Friedrich Otto. - Cham :Springer Nature Switzerland :2025. - viii, 409 p. :ill., digital ;24 cm. - Theory and applications of computability, in cooperation with the association Computability in Europe,2190-6203. - Theory and applications of computability..

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.

ISBN: 9783031700941

Standard No.: 10.1007/978-3-031-70094-1doiSubjects--Topical Terms:

670080
Computational Linguistics.

LC Class. No.: QA267

Dewey Class. No.: 511.35

Restarting automata = the standard type of restarting automaton and its variants /
LDR:01329nam a2200325 a 4500 001 1159826
003 DE-He213
005 20241030115848.0
006 m d
007 cr nn 008maaau
008 251029s2025 sz s 0 eng d
020 $a 9783031700941 $q (electronic bk.)
020 $a 9783031700934 $q (paper)
024 7 $a 10.1007/978-3-031-70094-1 $2 doi
035 $a 978-3-031-70094-1
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 .O91 2025
100 1 $a Otto, Friedrich. $3 682766
245 1 0 $a Restarting automata $h [electronic resource] : $b the standard type of restarting automaton and its variants / $c by Friedrich Otto.
260 $a Cham : $c 2025. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a viii, 409 p. : $b ill., digital ; $c 24 cm.
490 1 $a Theory and applications of computability, in cooperation with the association Computability in Europe, $x 2190-6203
505 0 $a 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.
650 2 4 $a Computational Linguistics. $3 670080
650 2 4 $a Formal Languages and Automata Theory. $3 1365747
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Machine theory. $3 527775
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Theory and applications of computability. $3 1110033
856 4 0 $u https://doi.org/10.1007/978-3-031-70094-1
950 $a Computer Science (SpringerNature-11645)

筆 0 讀者評論

多媒體

評論

新增評論分享你的心得

Export

取書館別