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...

詳細記述

書誌詳細

第一著者:	Otto, Friedrich (著者)
団体著者:	SpringerLink (Online service)
フォーマット:	電子媒体 eBook
言語:	英語
出版事項:	Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
版:	1st ed. 2025.
シリーズ:	Theory and Applications of Computability, In cooperation with the Association Computability in Europe,
主題:	Computer science. Machine theory. Computational linguistics. Theory of Computation. Formal Languages and Automata Theory. Computational Linguistics.
オンライン･アクセス:	https://doi.org/10.1007/978-3-031-78701-0
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!