书目名称 | Restarting Automata |
副标题 | The Standard Type of |
编辑 | Friedrich Otto |
视频video | |
概述 | Offers a comprehensive survey of restarting automata and results generated from them.Presents systematically the various types of restarting automata.Provides extremely complete reference lists, for m |
丛书名称 | Theory and Applications of Computability |
图书封面 |  |
描述 | .The subject of this monograph are restarting automata. The definition of these automata is motivated by the linguistic technique of analysis by reduction. This technique, which can be used to analyze sentences in natural languages with a rather free word-order like Czech (or Latin or German), consists of a sequence of step-by-step simplifications of a given sentence. Each of these simplifications is realized by a single reduction operation, which consists of either the deletion of one or several words from that sentence or the replacement of a (possibly discontinuous) substring of that sentence by a shorter substring. It is required that each application of such a reduction operation must preserve the syntactical correctness of the sentence. Accordingly, a restarting automaton consists of a finite-state control, a flexible tape that initially contains the input, and a read-write window of a fixed finite size that works on that tape. The first type of restarting automaton was presented at the international conference FCT in 1995. This type was required to restart as soon as it executes a rewrite operation, that is, the window jumps back to the left end of the tape and the finite-st |
出版日期 | Book 2025 |
关键词 | Reduction analysis; Chomsky hierarchy; Automaton with output; Descriptional complexity; Parallel communi |
版次 | 1 |
doi | https://doi.org/10.1007/978-3-031-70094-1 |
isbn_softcover | 978-3-031-70096-5 |
isbn_ebook | 978-3-031-70094-1Series ISSN 2190-619X Series E-ISSN 2190-6203 |
issn_series | 2190-619X |
copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl |