Alexander Meduna, Zbynek Krivka

Jumping Computation

Updating Automata and Grammars for Discontinuous Information Processing

• Broschiertes Buch

Produktbeschreibung

Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, case studies and applications based upon these automata and grammars.

In today's computerized world, the scientific development and study of computation, referred to as the theory of computation, plays a crucial role. One important branch, language theory, investigates how to define and study languages and their models, which formalize algorithms according to which 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, such as sequential, semi-parallel and totally parallel computation, and explains how the model in question properly reflects and formalizes the corresponding form of computation, thus allowing us to obtain a systematized body of mathematically precise knowledge concerning the jumping computation. The book pays a special attention to power, closure properties, and transformations, and also describes many algorithms that modify jumping grammars and automata so they satisfy some prescribed properties without changing the defined language. The book will be of great interest to anyone researching the theory of computation across the fields of computer science, mathematics, engineering, logic and linguistics.

Produktdetails

• Verlag: CRC Press / Taylor & Francis
• Seitenzahl: 294
• Erscheinungstermin: 7. März 2024
• Englisch
• Abmessung: 234mm x 156mm x 16mm
• Gewicht: 426g
• ISBN-13: 9780367634797
• ISBN-10: 0367634791
• Artikelnr.: 69484246

Autorenporträt

Alexander Meduna (born 1957 in Olomouc, Czech Republic) is a theoretical computer scientist and expert on the theory of computation. 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, including the University of Missouri, where he spent a decade teaching advanced 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 ninety papers and several books, listed at http://www.fit.vutbr.cz/~meduna/work. 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, and his PhD thesis, which also deals with formal languages, has been published as a book.

Inhaltsangabe

Part I Introduction. 1 Mathematical Background. 1.1 Logic. 1.2 Sets and Languages. 1.3 Relations and Translations. 1.4 Graphs. 2 Automata and Grammars. 2.1 Language Models of Computation. 2.2 Automata. 2.3 Grammars. Part II Jumping Automata. 3 Jumping One-Head Automata. 3.1 Basic and Generalized Jumping Finite Automata. 3.2 One-way Jumping Finite Automata. 4 Jumping Multi-Head Automata. 4.1 Double-Jumping Finite Automata. 4.2 Multi-Parallel Jumping Finite Automata. 4.3 Jumping Watson-Crick Finite Automata. 4.4 Jumping 5' 3' Watson-Crick Finite Automata. Part III Jumping Grammar. 5 Sequential Jumping Grammars. 5.1 Introduction. 5.2 Definitions and Examples. 5.3 Results. 6 Parallel Jumping Grammars. 6.1 Introduction. 6.2 Definitions. 6.3 Results. 7 Pure Jumping Grammars. 7.1 Introduction. 7.2 Definitions. 7.3 Results. Part IV Conclusion. 8 Other Models of Discontinuous Computation. 8.1 Deep Pushdown Automata. 8.2 Computation over unordered strings. 8.3 Permutation Grammars. 9 Remarks on Applications and Their Perspectives. 9.1 Jumping Automata Used as Language-Defining Devices. 9.2 Jumping Grammars Used as Models of DNA Computation. 9.3 Theoretically Oriented Applications. 10 Summarizing and Bibliographical Remarks. Bibliography. Index.