Modern Language Models and Computation: Theory with Applications
Autor Alexander Meduna, Ondřej Soukupen Limba Engleză Hardback – 17 oct 2017
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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 645.66 lei 6-8 săpt. | |
Springer International Publishing – 18 mai 2018 | 645.66 lei 6-8 săpt. | |
Hardback (1) | 652.14 lei 6-8 săpt. | |
Springer International Publishing – 17 oct 2017 | 652.14 lei 6-8 săpt. |
Preț: 652.14 lei
Preț vechi: 815.18 lei
-20% Nou
Puncte Express: 978
Preț estimativ în valută:
124.85€ • 129.77$ • 103.51£
124.85€ • 129.77$ • 103.51£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319630991
ISBN-10: 3319630997
Pagini: 548
Ilustrații: XIX, 548 p. 20 illus.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 0.97 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319630997
Pagini: 548
Ilustrații: XIX, 548 p. 20 illus.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 0.97 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
Cuprins
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.
Recenzii
“The book can … be fruitfully used by a broad variety of scientists, from researchers working on related theoretical disciplines (mathematicians, computer scientists) to researchers working on various applications (e.g., linguists, engineers, biologists).” (Benedek Nagy, Mathematical Reviews, June, 2020)
“The book provides a concise theoretical treatment of a selection of advanced string-grammar formalisms used particularly in formal language theory. … This research monograph can serve as an excellent reference for non-standard grammar formalisms with a strong focus on regulation. All relevant results are presented in full detail and proper references are provided to the original literature. The mentioned applications serve as motivation, but the main emphasis is clearly on the exposition of thetheoretical results.” (Andreas Maletti, zbMATH 1385.68002, 2018)
Notă biografică
Alexander Meduna, Full Professor of Computer Science at the Brno University of Technology, received his PhD from this university in 1988. He has taught mathematics and computer science at various European, Asian, and American universities, including the University of Missouri, where he spent a decade teaching advanced topics of the formal language theory and its applications in computer science. He is the author of the books entitled Automata and Languages (Springer, 2000), Elements of Compiler Design (Taylor and Francis, 2008), and Formal Languages and Computation: Models and Their Applications (CRC Press, 2014) . Along with his former PhD students, he is also the co-author of Grammars with Context Conditions and Their Applications (co-authored by M. Švec, Wiley, 2005), Scattered Context Grammars and Their Applications (co-authored by J. Techet, WIT Press, 2010), and Regulated Grammars and Automata (co-authored by P. Zemek, Springer, 2014). He has published over ninety papers closely related to the subject of this book.
Ondřej Soukup received his PhD from the Brno University of Technology in 2017 under the supervision of Alexander Meduna. He has published several studies on modern language models in such distinguished computer science journals as Fundamenta Informatica, International Journal of Foundations of Computer Science, and Theoretical Computer Science.
Ondřej Soukup received his PhD from the Brno University of Technology in 2017 under the supervision of Alexander Meduna. He has published several studies on modern language models in such distinguished computer science journals as Fundamenta Informatica, International Journal of Foundations of Computer Science, and Theoretical Computer Science.
Caracteristici
Provides up-to-date coverage of modern language models Introduces clear definitions and theoretical concepts Provides many easy-to-implement algorithms Includes worked-out examples and case studies Demonstrates how theory and practice work together Provides realistic applications in many scientific fields, such as biology and linguistics Presents perspectives and expected future development Offers exhaustive references and bibliographical notes Includes an accompanying Website Includes supplementary material: sn.pub/extras