Author: Alexander Meduna
Publisher: WIT Press
ISBN: 1845644263
Category : Computers
Languages : en
Pages : 225
Get Book Here
Book Description
This computer science book represents scattered information by formal languages and gives an in-depth discussion of scattered context grammars as formal means that process these languages. It is primarily meant as a monograph on these grammars, which represent an important trend of todays formal language theory. The text maintains a balance between fundamental concepts, theoretical results, and applications of these grammars. From a theoretical viewpoint, it introduces several variants of scattered context grammatical models. Based on these models, it demonstrates the concepts, methods, and techniques employed in handling scattered pieces of information with enough rigors to make them quite clear. It also explains a close relation between the subject of the book and several important mathematical fields, such as algebra and graph theory. From a more practical point of view, this book describes scattered information processing by fundamental information technologies. Throughout this book, several in-depth case studies and examples are carefully presented. Whilst discussing various methods concerning grammatical processing of scattered information, the text illustrates their applications with a focus on applications in linguistics.
Author: Alexander Meduna
Publisher: John Wiley & Sons
ISBN: 0471736554
Category : Computers
Languages : en
Pages : 232
Get Book Here
Book Description
The essential guide to grammars with context conditions This advanced computer science book systematically and compactlysummarizes the current knowledge about grammars with contextconditions-an important area of formal language theory. Accordingto the types of context conditions, this self-contained referenceclassifies them into grammars with context conditions placed on thedomains of grammatical derivations, the use of grammaticalproductions, and the neighborhood of the rewritten symbols. Thefocus is on grammatical generative power, important properties,simplification, reduction, implementation, and applications, mostof which are related to microbiology. The text features: * Up-to-date coverage of grammatical concepts based on contextconditions * Self-contained explanations without assumption of any previousknowledge * Clear definitions and exact proofs preceded by intuitiveexplanations * Numerous easy-to-implement grammatical transformations * Realistic applications * Relation to mathematics, linguistics, and biology * Additional material and information about the book available onaccompanying Web site (see preface for details) Practitioners and advanced students in theoretical computer scienceand related areas- including mathematics, linguistics, andmolecular biology-will find Grammars with Context Conditions andTheir Applications an essential reference for this cutting-edgearea of formal language theory.
Author: Alexander Meduna
Publisher: World Scientific
ISBN: 9811278148
Category : Computers
Languages : en
Pages : 437
Get Book Here
Book Description
This book provides an in-depth analysis of classical automata theory, including finite automata, pushdown automata, and Turing machines. It also covers current trends in automata theory, such as jumping, deep pushdown, and regulated automata. The book strikes a balance between a theoretical and practical approach to its subject by presenting many real world applications of automata in a variety of scientific areas, ranging from programming language processing through natural language syntax analysis up to computational musicology.In Automata: Theories, Trends and Applications all formalisms concerning automata are rigorously introduced, and every complicated mathematical passage is preceded by its intuitive explanation so that even complex parts of the book are easy to grasp. The book also demonstrates how automata underlie several computer-science engineering techniques.This monograph is a useful reference for scientists working in the areas of theoretical computer science, computational mathematics, computational linguistics, and compiler writing. It may also be used as a required text in classes dealing with the theory and applications of automata, and theory of computation at the graduate level. This book comes with access to a website which supplies supplementary material such as exercises with solutions, additional case studies, lectures to download, teaching tips for instructors, and more.
Author: Alexander Meduna
Publisher: Springer
ISBN: 1493903691
Category : Computers
Languages : en
Pages : 691
Get Book Here
Book Description
This is the first book to offer key theoretical topics and terminology concerning regulated grammars and automata. They are the most important language-defining devices that work under controls represented by additional mathematical mechanisms. Key topics include formal language theory, grammatical regulation, grammar systems, erasing rules, parallelism, word monoids, regulated and unregulated automata and control languages. The book explores how the information utilized in computer science is most often represented by formal languages defined by appropriate formal devices. It provides both algorithms and a variety of real-world applications, allowing readers to understand both theoretical concepts and fundamentals. There is a special focus on applications to scientific fields including biology, linguistics and informatics. This book concludes with case studies and future trends for the field. Regulated Grammars and Automata is designed as a reference for researchers and professionals working in computer science and mathematics who deal with language processors. Advanced-level students in computer science and mathematics will also find this book a valuable resource as a secondary textbook or reference.
Author: Alexander Meduna
Publisher: CRC Press
ISBN: 1466513454
Category : Computers
Languages : en
Pages : 318
Get Book Here
Book Description
Formal Languages and Computation: Models and Their Applications gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. Emphasizing the relationship between theory and application, the book describes many real-world applications, including computer science engineering techniques for language processing and their implementation. Covers the theory of formal languages and their models, including all essential concepts and properties Explains how language models underlie language processors Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models—regular expressions, finite automata, context-free grammars, and pushdown automata Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure Reviews the general theory of computation, particularly computability and decidability Considers problem-deciding algorithms in terms of their computational complexity measured according to time and space requirements Points out that some problems are decidable in principle, but they are, in fact, intractable problems for absurdly high computational requirements of the algorithms that decide them In short, this book represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigors to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. After studying this book, both student and professional should be able to understand the fundamental theory of formal languages and computation, write language processors, and confidently follow most advanced books on the subject.
Author: Alexander Meduna
Publisher: Springer
ISBN: 3319631004
Category : Computers
Languages : en
Pages : 552
Get Book Here
Book Description
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.
Author: Grzegorz Rozenberg
Publisher: Springer Science & Business Media
ISBN: 9783540606482
Category : Computers
Languages : en
Pages : 564
Get Book Here
Book Description
The need for a comprehensive survey-type exposition on formal languages and related mainstream areas of computer science has been evident for some years. In the early 1970s, when the book Formal Languages by the second mentioned editor appeared, it was still quite feasible to write a comprehensive book with that title and include also topics of current research interest. This would not be possible anymore. A standard-sized book on formal languages would either have to stay on a fairly low level or else be specialized and restricted to some narrow sector of the field. The setup becomes drastically different in a collection of contributions, where the best authorities in the world join forces, each of them concentrat ing on their own areas of specialization. The present three-volume Handbook constitutes such a unique collection. In these three volumes we present the current state of the art in formallanguage theory. We were most satisfied with the enthusiastic response given to our request for contributions by specialists representing various subfields. The need for a Handbook of Formal Languages was in many answers expressed in different ways: as an easily accessible his torical reference, a general source of information, an overall course-aid, and a compact collection of material for self-study. We are convinced that the final result will satisfy such various needs.
Author: J. Berger
Publisher: Springer Science & Business Media
ISBN: 3642930484
Category : Mathematics
Languages : en
Pages : 295
Get Book Here
Book Description
Author: Alexander Meduna
Publisher: CRC Press
ISBN: 1003852602
Category : Computers
Languages : en
Pages : 968
Get Book Here
Book Description
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.
Author: Jürgen Dassow
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3112737873
Category : Computers
Languages : en
Pages : 308
Get Book Here
Book Description
No detailed description available for "Regulated Rewriting in Formal Language Theory".
