Alexander Meduna – författare

Visar alla böcker från författaren Alexander Meduna. Handla med fri frakt och snabb leverans.

22 produkter

Kategorier

22 produkter

Formal Languages and Computation
Models and Their Applications
AvAlexander Meduna
Häftad, Engelska, 2019
960 kr
Skickas inom 10-15 vardagar
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 propertiesExplains 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 automataDiscusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedureReviews 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 requirementsPoints 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 mathematic
Jumping Computation
Updating Automata and Grammars for Discontinuous Information Processing
AvAlexander Meduna,Zbyněk Křivka
Inbunden, Engelska, 2024
2 455 kr
Skickas inom 10-15 vardagar
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.
Jumping Computation
Updating Automata and Grammars for Discontinuous Information Processing
AvAlexander Meduna,Zbyněk Křivka
Häftad, Engelska, 2024
946 kr
Skickas inom 10-15 vardagar
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.
Grammars with Context Conditions and Their Applications
AvAlexander Meduna,Martin Švec
Inbunden, Engelska, 2005
1 565 kr
Skickas inom 5-8 vardagar
The essential guide to grammars with context conditionsThis advanced computer science book systematically and compactly summarizes the current knowledge about grammars with context conditions—an important area of formal language theory. According to the types of context conditions, this self-contained reference classifies them into grammars with context conditions placed on the domains of grammatical derivations, the use of grammatical productions, and the neighborhood of the rewritten symbols. The focus is on grammatical generative power, important properties, simplification, reduction, implementation, and applications, most of which are related to microbiology.The text features: Up-to-date coverage of grammatical concepts based on context conditionsSelf-contained explanations without assumption of any previous knowledgeClear definitions and exact proofs preceded by intuitive explanationsNumerous easy-to-implement grammatical transformationsRealistic applicationsRelation to mathematics, linguistics, and biologyAdditional material and information about the book available on accompanying Web site (see preface for details)Practitioners and advanced students in theoretical computer science and related areas— including mathematics, linguistics, and molecular biology—will find Grammars with Context Conditions and Their Applications an essential reference for this cutting-edge area of formal language theory.
Grammars with Context Conditions and Their Applications
AvMartin vec,Alexander Meduna
E-bok
PDF, Engelska, 2005
1 798 kr
Läs direkt efter köp
The essential guide to grammars with context conditions This advanced computer science book systematically and compactly summarizes the current knowledge about grammars with context conditions-an important area of formal language theory. According to the types of context conditions, this self-contained reference classifies them into grammars with context conditions placed on the domains of grammatical derivations, the use of grammatical productions, and the neighborhood of the rewritten symbols. The focus is on grammatical generative power, important properties, simplification, reduction, implementation, and applications, most of which are related to microbiology. The text features: * Up-to-date coverage of grammatical concepts based on context conditions * Self-contained explanations without assumption of any previous knowledge * Clear definitions and exact proofs preceded by intuitive explanations * Numerous easy-to-implement grammatical transformations * Realistic applications * Relation to mathematics, linguistics, and biology * Additional material and information about the book available on accompanying Web site (see preface for details) Practitioners and advanced students in theoretical computer science and related areas- including mathematics, linguistics, and molecular biology-will find Grammars with Context Conditions and Their Applications an essential reference for this cutting-edge area of formal language theory.
Jumping Computation
Updating Automata and Grammars for Discontinuous Information Processing
AvZbynek Krivka,Alexander Meduna
E-bok
PDF, Engelska, 2024
1 107 kr
Läs direkt efter köp
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.
Jumping Computation
Updating Automata and Grammars for Discontinuous Information Processing
AvZbynek Krivka,Alexander Meduna
E-bok
Engelska, 2024
1 107 kr
Läs direkt efter köp
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.
Formal Languages and Computation
Models and Their Applications
AvAlexander Meduna
E-bok
Engelska, 2014
1 134 kr
Läs direkt efter köp
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 computatio
Elements of Compiler Design
AvAlexander Meduna
E-bok
Engelska, 2007
1 815 kr
Läs direkt efter köp
Maintaining a balance between a theoretical and practical approach to this important subject, Elements of Compiler Design serves as an introduction to compiler writing for undergraduate students. From a theoretical viewpoint, it introduces rudimental models, such as automata and grammars, that underlie compilation and its essential phases. Based on
Elements of Compiler Design
AvAlexander Meduna
E-bok
PDF, Engelska, 2007
1 796 kr
Läs direkt efter köp
Maintaining a balance between a theoretical and practical approach to this important subject, Elements of Compiler Design serves as an introduction to compiler writing for undergraduate students. From a theoretical viewpoint, it introduces rudimental models, such as automata and grammars, that underlie compilation and its essential phases. Based on
Automata and Languages
Theory and Applications
AvAlexander Meduna
E-bok
PDF, Engelska, 2012
1 463 kr
Läs direkt efter köp
Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses based on selected material. Areas featured in the book include:- *basic models of computation *formal languages and their properties *computability, decidability and complexity *a discussion of the modern trends in the theory of automata and formal languages *design of programming languages, including the development of a new programming language *compiler design, including the construction of a complete compiler Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader''s comprehension, and, to put the theory firmly into a ''real world'' context, he presents lots of realistic illustrations and applications in practical computer science.
Formal Languages and Computation
Models and Their Applications
AvAlexander Meduna
Inbunden, Engelska, 2014
1 531 kr
Skickas inom 10-15 vardagar
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 propertiesExplains 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 automataDiscusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedureReviews 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 requirementsPoints 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 mathematic
Formal Languages and Computation
Models and Their Applications
AvAlexander Meduna
E-bok
PDF, Engelska, 2014
1 122 kr
Läs direkt efter köp
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 computatio
Regulated Grammars and Automata
AvAlexander Meduna,Petr Zemek
Inbunden, Engelska, 2014
1 108 kr
Skickas inom 10-15 vardagar
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.
Regulated Grammars and Automata
AvPetr Zemek,Alexander Meduna
E-bok
PDF, Engelska, 2014
1 413 kr
Läs direkt efter köp
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.
Regulated Grammars and Automata
AvAlexander Meduna,Petr Zemek
Häftad, Engelska, 2016
1 108 kr
Skickas inom 10-15 vardagar
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.
Handbook of Mathematical Models for Languages and Computation
AvAlexander Meduna,Petr Horáčekm. fl.
Inbunden, Engelska, 2020
2 096 kr
Skickas inom 3-6 vardagar
The theory of computation is used to address challenges arising in many computer science areas such as artificial intelligence, language processors, compiler writing, information and coding systems, programming language design, computer architecture and more. To grasp topics concerning this theory readers need to familiarize themselves with its computational and language models, based on concepts of discrete mathematics including sets, relations, functions, graphs and logic.This handbook introduces with rigor the important concepts of this kind and uses them to cover the most important mathematical models for languages and computation, such as various classical as well as modern automata and grammars. It explains their use in such crucially significant topics of computation theory as computability, decidability, and computational complexity. The authors pay special attention to the implementation of all these mathematical concepts and models and explains clearly how to encode them in computational practice. All computer programs are written in C#.
Automata and Languages
Theory and Applications
AvAlexander Meduna
Häftad, Engelska, 2000
1 142 kr
Skickas inom 10-15 vardagar
Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses based on selected material. Areas featured in the book include:- *basic models of computation *formal languages and their properties *computability, decidability and complexity *a discussion of the modern trends in the theory of automata and formal languages *design of programming languages, including the development of a new programming language *compiler design, including the construction of a complete compiler Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and, to put the theory firmly into a 'real world' context, he presents lots of realistic illustrations and applications in practical computer science.
Modern Language Models and Computation
Theory with Applications
AvAlexander Meduna,Ondřej Soukup
Inbunden, Engelska, 2017
1 142 kr
Skickas inom 10-15 vardagar
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.
Modern Language Models and Computation
Theory with Applications
AvOndrej Soukup,Alexander Meduna
E-bok
Engelska, 2017
1 455 kr
Läs direkt efter köp
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.
Modern Language Models and Computation
Theory with Applications
AvAlexander Meduna,Ondřej Soukup
Häftad, Engelska, 2018
1 142 kr
Skickas inom 10-15 vardagar
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.
AUTOMATA: THEORY, TRENDS, AND APPLICATIONS
AvAlexander Meduna,Tomáš Kožár
Inbunden, Engelska, 2023
2 041 kr
Skickas inom 3-6 vardagar
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.

Företag, bibliotek eller offentlig verksamhet?

Alexander Meduna – författare

Formal Languages and Computation

Jumping Computation

Jumping Computation

Grammars with Context Conditions and Their Applications

Grammars with Context Conditions and Their Applications

Jumping Computation

Jumping Computation

Formal Languages and Computation

Elements of Compiler Design

Elements of Compiler Design

Automata and Languages

Formal Languages and Computation

Formal Languages and Computation

Regulated Grammars and Automata

Regulated Grammars and Automata

Regulated Grammars and Automata

Handbook of Mathematical Models for Languages and Computation

Automata and Languages

Modern Language Models and Computation

Modern Language Models and Computation

Modern Language Models and Computation

AUTOMATA: THEORY, TRENDS, AND APPLICATIONS

Mina sidor

Mina sidor

Hjälp

Hjälp

Om Bokus

Om Bokus

Populärt

Populärt

Inspiration

Inspiration