國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Modern language models and computati...

Meduna, Alexander.

Modern language models and computationtheory with applications /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Modern language models and computationby Alexander Meduna, Ondrej Soukup.
其他題名:	theory with applications /
作者:	Meduna, Alexander.
其他作者:	Soukup, Ondrej.
出版者:	Cham :Springer International Publishing :2017.
面頁冊數:	xix, 548 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Mathematical linguistics.
電子資源:	http://dx.doi.org/10.1007/978-3-319-63100-4
ISBN:	9783319631004$q(electronic bk.)

Modern language models and computationtheory with applications /
Meduna, Alexander.

Modern language models and computationtheory with applications /[electronic resource] :by Alexander Meduna, Ondrej Soukup. - Cham :Springer International Publishing :2017. - xix, 548 p. :ill., digital ;24 cm.

Abstract -- Acknowledgments -- Preface -- Mathematical Background -- Classical Rewriting in Language Theory: Basics -- Regulated Generation -- Parallel Generation -- Jumping Generation -- Alternative Generation Based on Algebraic Restrictions -- Regulated Acceptance -- Jumping Acceptance -- Acceptance with Deep Pushdowns -- Alternative Acceptance Based on Algebraic Restrictions -- Generation of Languages by Automata -- Language Multigeneration by Grammar Systems -- Applications and Their Perspectives in General -- Applications in Linguistics -- Applications in Biology -- Concluding and Bibliographical Remarks -- Bibliography -- Index to Special Symbols -- Index to Language Famiolies and Their Models -- Subject Index.

This textbook gives a systematized and compact summary, providing the most essential types of modern models for languages and computation together with their properties and applications. Most of these models properly reflect and formalize current computational methods, based on parallelism, distribution and cooperation covered in this book. As a result, it allows the user to develop, study, and improve these methods very effectively. This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, and computer science. Advanced-level students studying computer science, mathematics, linguistics and biology will find this textbook a valuable resource. Theoreticians, practitioners and researchers working in today's theory of computation and its applications will also find this book essential as a reference.

ISBN: 9783319631004$q(electronic bk.)

Standard No.: 10.1007/978-3-319-63100-4doiSubjects--Topical Terms:

180844
Mathematical linguistics.

LC Class. No.: P138

Dewey Class. No.: 401.51

Modern language models and computationtheory with applications /
LDR:02862nmm a2200337 a 4500 001 523317
003 DE-He213
005 20180420152043.0
006 m d
007 cr nn 008maaau
008 180628s2017 gw s 0 eng d
020 $a 9783319631004$q(electronic bk.)
020 $a 9783319630991$q(paper)
024 7 $a 10.1007/978-3-319-63100-4 $2 doi
035 $a 978-3-319-63100-4
040 $a GP $c GP
041 0 $a eng
050 4 $a P138
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 401.51 $2 23
090 $a P138 $b .M493 2017
100 1 $a Meduna, Alexander. $3 679513
245 1 0 $a Modern language models and computation $h [electronic resource] : $b theory with applications / $c by Alexander Meduna, Ondrej Soukup.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xix, 548 p. : $b ill., digital ; $c 24 cm.
505 0 $a Abstract -- Acknowledgments -- Preface -- Mathematical Background -- Classical Rewriting in Language Theory: Basics -- Regulated Generation -- Parallel Generation -- Jumping Generation -- Alternative Generation Based on Algebraic Restrictions -- Regulated Acceptance -- Jumping Acceptance -- Acceptance with Deep Pushdowns -- Alternative Acceptance Based on Algebraic Restrictions -- Generation of Languages by Automata -- Language Multigeneration by Grammar Systems -- Applications and Their Perspectives in General -- Applications in Linguistics -- Applications in Biology -- Concluding and Bibliographical Remarks -- Bibliography -- Index to Special Symbols -- Index to Language Famiolies and Their Models -- Subject Index.
520 $a This textbook gives a systematized and compact summary, providing the most essential types of modern models for languages and computation together with their properties and applications. Most of these models properly reflect and formalize current computational methods, based on parallelism, distribution and cooperation covered in this book. As a result, it allows the user to develop, study, and improve these methods very effectively. This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, and computer science. Advanced-level students studying computer science, mathematics, linguistics and biology will find this textbook a valuable resource. Theoreticians, practitioners and researchers working in today's theory of computation and its applications will also find this book essential as a reference.
650 0 $a Mathematical linguistics. $3 180844
650 0 $a Computational linguistics. $3 181250
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Mathematics of Computing. $3 273710
650 2 4 $a Computational Linguistics. $3 274669
700 1 $a Soukup, Ondrej. $3 794438
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-63100-4
950 $a Computer Science (Springer-11645)