找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Restarting Automata; The Standard Type of Friedrich Otto Book 2025 The Editor(s) (if applicable) and The Author(s), under exclusive license

[復(fù)制鏈接]
查看: 21347|回復(fù): 35
樓主
發(fā)表于 2025-3-21 19:23:42 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Restarting Automata
副標(biāo)題The Standard Type of
編輯Friedrich Otto
視頻videohttp://file.papertrans.cn/833/832634/832634.mp4
概述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
叢書(shū)名稱(chēng)Theory and Applications of Computability
圖書(shū)封面Titlebook: Restarting Automata; The Standard Type of Friedrich Otto Book 2025 The Editor(s) (if applicable) and The Author(s), under exclusive license
描述.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
關(guān)鍵詞Reduction analysis; Chomsky hierarchy; Automaton with output; Descriptional complexity; Parallel communi
版次1
doihttps://doi.org/10.1007/978-3-031-70094-1
isbn_softcover978-3-031-70096-5
isbn_ebook978-3-031-70094-1Series ISSN 2190-619X Series E-ISSN 2190-6203
issn_series 2190-619X
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

書(shū)目名稱(chēng)Restarting Automata影響因子(影響力)




書(shū)目名稱(chēng)Restarting Automata影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Restarting Automata網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Restarting Automata網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Restarting Automata被引頻次




書(shū)目名稱(chēng)Restarting Automata被引頻次學(xué)科排名




書(shū)目名稱(chēng)Restarting Automata年度引用




書(shū)目名稱(chēng)Restarting Automata年度引用學(xué)科排名




書(shū)目名稱(chēng)Restarting Automata讀者反饋




書(shū)目名稱(chēng)Restarting Automata讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶(hù)組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:49:54 | 只看該作者
https://doi.org/10.1007/978-3-031-70094-1Reduction analysis; Chomsky hierarchy; Automaton with output; Descriptional complexity; Parallel communi
板凳
發(fā)表于 2025-3-22 01:25:49 | 只看該作者
地板
發(fā)表于 2025-3-22 04:35:34 | 只看該作者
5#
發(fā)表于 2025-3-22 09:36:51 | 只看該作者
6#
發(fā)表于 2025-3-22 15:31:52 | 只看該作者
Book 2025tion. 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, whic
7#
發(fā)表于 2025-3-22 20:37:45 | 只看該作者
2190-619X automata.Provides extremely complete reference lists, for m.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 r
8#
發(fā)表于 2025-3-22 22:09:27 | 只看該作者
2190-619X 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-st978-3-031-70096-5978-3-031-70094-1Series ISSN 2190-619X Series E-ISSN 2190-6203
9#
發(fā)表于 2025-3-23 02:10:21 | 只看該作者
10#
發(fā)表于 2025-3-23 07:42:45 | 只看該作者
Stand der Technik und Aufgabenstellung,llen dabei erzielbaren Erkenntnissen keine genauen Aussagen über den Einflu? der Form?nderungsgeschwindigkeit auf die Form?nderungsfestigkeit. Statische Warm-Stauchversuche von F. . [6] und E. . [7] kamen zwar den Beanspruchungen der technischen Formgebungsprozesse in diesen Temperaturbereichen n?he
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-21 22:07
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
稻城县| 贵阳市| 沈阳市| 梁河县| 曲松县| 城固县| 方山县| 兴义市| 太湖县| 北京市| 珠海市| 许昌县| 米林县| 潜山县| 成武县| 民丰县| 富顺县| 会宁县| 岚皋县| 通辽市| 蓝山县| 定兴县| 奉新县| 陇南市| 浦东新区| 谢通门县| 黔西| 庆安县| 拉萨市| 漳平市| 称多县| 栖霞市| 广东省| 莆田市| 钟山县| 错那县| 剑川县| 南充市| 新津县| 井冈山市| 德江县|