This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
lectures:books:jc [2023/12/12 12:36] – krivka | lectures:books:jc [2024/04/08 16:27] (current) – [About this book] krivka | ||
---|---|---|---|
Line 5: | Line 5: | ||
|ISBN: | |ISBN: | ||
|DOI: | |DOI: | ||
- | |Publication Date:|2023-2024| | + | |Publication Date:|March 6, 2024| |
- | |Details: | + | |Details:|Paperback and Hardcover, |
+ | |||
+ | Available at [[https:// | ||
===== Authors ===== | ===== Authors ===== | ||
- | TBA | + | **Alexander Meduna** is a theoretical computer scientist and expert on the theory of computation who |
+ | was born in the Czech Republic. He is a full professor of Computer Science at the Brno University of | ||
+ | Technology. Formerly, he taught theoretical computer science at various American, Asian and European | ||
+ | universities, | ||
+ | topics of formal language theory and Kyoto Sangyo University, where he spent several months teaching | ||
+ | these topics, too. Concerning the subject of this book, he is the author of over 90 papers and | ||
+ | several books, listed at: [[https:// | ||
+ | |||
+ | **Zbyněk Křivka** is both a theoretically and pragmatically oriented computer scientist. Being a former | ||
+ | PhD student of Alexander Meduna and, currently, his colleague at the Brno University of Technology, | ||
+ | he has published several journal papers with strong focus on jumping models. His PhD thesis, which | ||
+ | also deals with formal languages, has been published as a book. | ||
===== Book ===== | ===== Book ===== | ||
==== About this book ==== | ==== About this book ==== | ||
- | TBA | + | {{ : |
+ | |||
+ | In today’s computerized world, the scientific development and study of computation, | ||
+ | their computation is executed. These language-defining models are classified into two basic categories: automata, which define languages by recognizing their words, and grammars, which generate them. Introduced many decades ago, these rules reflect classical sequential computation. However, | ||
+ | today’s computational methods frequently process information in a fundamentally different way, frequently “jumping” over large portions of the information as a whole. This book adapts classical models to formalize and study this kind of computation properly. Simply put, during their language-defining process, these adapted versions, called jumping automata and grammars, jump across the | ||
+ | words they work on. | ||
+ | |||
+ | The book selects important models and summarizes key results about them in a compact and uniform way. It relates each model to a particular form of modern computation, | ||