Modern Language Models and Computation

Theory with Applications

AvAlexander Meduna,Ondřej Soukup

Inbunden, Engelska, 2017

1 142 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

1 142 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2017-10-17
Mått:155 x 235 x 38 mm
Vikt:1 020 g
Format:Inbunden
Språk:Engelska
Antal sidor:548
Upplaga:17001
Förlag:Springer International Publishing AG
ISBN:9783319630991

Utforska kategorier

Mer om författaren

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.

Recensioner i media

“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)

Innehållsförteckning

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.