找回密碼
 To register

QQ登錄

只需一步，快速開始

掃一掃，訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Regulated Grammars and Automata; Alexander Meduna,Petr Zemek Book 2014 Springer Science+Business Media New York 2014 Algorithms.Automata.C

[復制鏈接]
查看: 13323|回復: 50
樓主
發(fā)表于 2025-3-21 17:38:13 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Regulated Grammars and Automata
編輯Alexander Meduna,Petr Zemek
視頻videohttp://file.papertrans.cn/826/825575/825575.mp4
概述Offers key theoretical topics and terminology concerning regulated grammars and automata.Includes real-world applications and future trends in the field.Covers easy-to-follow theoretical concepts and
圖書封面Titlebook: Regulated Grammars and Automata; Alexander Meduna,Petr Zemek Book 2014 Springer Science+Business Media New York 2014 Algorithms.Automata.C
描述This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata. They are the most important language-defining devices that work under controls represented by additional mathematical mechanisms. Key topics include formal language theory, grammatical regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages. The book explores how the information utilized in computer science is most often represented by formal languages defined by appropriate formal devices. It provides both algorithms and a variety of real-world applications, allowing readers to understand both theoretical concepts and fundamentals. There is a special focus on applications to scientific fields including biology, linguistics and informatics. This book concludes with case studies and future trends for the field. Regulated Grammars and Automata is designed as a reference for researchers and professionals working in computer science and mathematics who deal with language processors. Advanced-level students in computer science and mathematics will also find this book a valuable resource as a secondary t
出版日期Book 2014
關鍵詞Algorithms; Automata; Control languages; Deep pushdown automata; Formal applications; Grammars; Linguistic
版次1
doihttps://doi.org/10.1007/978-1-4939-0369-6
isbn_softcover978-1-4939-4316-6
isbn_ebook978-1-4939-0369-6
copyrightSpringer Science+Business Media New York 2014
The information of publication is updating

書目名稱Regulated Grammars and Automata影響因子(影響力)




書目名稱Regulated Grammars and Automata影響因子(影響力)學科排名




書目名稱Regulated Grammars and Automata網(wǎng)絡公開度




書目名稱Regulated Grammars and Automata網(wǎng)絡公開度學科排名




書目名稱Regulated Grammars and Automata被引頻次




書目名稱Regulated Grammars and Automata被引頻次學科排名




書目名稱Regulated Grammars and Automata年度引用




書目名稱Regulated Grammars and Automata年度引用學科排名




書目名稱Regulated Grammars and Automata讀者反饋




書目名稱Regulated Grammars and Automata讀者反饋學科排名




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

0票 0.00%

Perfect with Aesthetics
 

0票 0.00%

Better Implies Difficulty
 

1票 100.00%

Good and Satisfactory
 

0票 0.00%

Adverse Performance
 

0票 0.00%

Disdainful Garbage
您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 20:58:50 | 只看該作者
Alexander Meduna,Petr Zemekology. Thompson’s unique and insightful approach to addressing the risks and questions of public acceptability associated with novel technology stands as a model for anyone interested in technological innovatio978-90-481-7446-1978-1-4020-5791-5Series ISSN 1570-3010 Series E-ISSN 2215-1737
板凳
發(fā)表于 2025-3-22 00:40:03 | 只看該作者
地板
發(fā)表于 2025-3-22 05:37:12 | 只看該作者
Alexander Meduna,Petr Zemekology. Thompson’s unique and insightful approach to addressing the risks and questions of public acceptability associated with novel technology stands as a model for anyone interested in technological innovatio978-90-481-7446-1978-1-4020-5791-5Series ISSN 1570-3010 Series E-ISSN 2215-1737
5#
發(fā)表于 2025-3-22 09:21:55 | 只看該作者
Alexander Meduna,Petr Zemekology. Thompson’s unique and insightful approach to addressing the risks and questions of public acceptability associated with novel technology stands as a model for anyone interested in technological innovatio978-90-481-7446-1978-1-4020-5791-5Series ISSN 1570-3010 Series E-ISSN 2215-1737
6#
發(fā)表于 2025-3-22 14:51:41 | 只看該作者
7#
發(fā)表于 2025-3-22 20:49:57 | 只看該作者
8#
發(fā)表于 2025-3-22 22:55:18 | 只看該作者
essionals working in computer science and mathematics who deal with language processors. Advanced-level students in computer science and mathematics will also find this book a valuable resource as a secondary t978-1-4939-4316-6978-1-4939-0369-6
9#
發(fā)表于 2025-3-23 03:26:25 | 只看該作者
, and the transatlantic debate between United States and European perspectives on biotechnology. Thompson’s unique and insightful approach to addressing the risks and questions of public acceptability associated with novel technology stands as a model for anyone interested in technological innovatio
10#
發(fā)表于 2025-3-23 06:09:16 | 只看該作者
, and the transatlantic debate between United States and European perspectives on biotechnology. Thompson’s unique and insightful approach to addressing the risks and questions of public acceptability associated with novel technology stands as a model for anyone interested in technological innovatio
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-22 19:18
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
宕昌县| 乌兰察布市| 华阴市| 顺昌县| 徐水县| 桓仁| 阳谷县| 阳城县| 莎车县| 镇平县| 阿坝| 崇仁县| 红桥区| 商水县| 敦煌市| 永修县| 米易县| 黄骅市| 涟水县| 芦溪县| 沁阳市| 芦山县| 噶尔县| 高雄县| 略阳县| 宜兰县| 德江县| 白玉县| 镇巴县| 雅安市| 资源县| 咸阳市| 乌鲁木齐市| 兴山县| 望都县| 城固县| 民县| 阳城县| 奉节县| 鲁山县| 九江县|