|
|
|
|
| LEADER |
05345nmm a2200397 u 4500 |
| 001 |
EB002216332 |
| 003 |
EBX01000000000000001353293 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
240701 ||| eng |
| 020 |
|
|
|a 9780323972178
|
| 050 |
|
4 |
|a QA267
|
| 100 |
1 |
|
|a Chavan, Pallavi
|
| 245 |
0 |
0 |
|a Automata theory and formal languages
|c Pallavi Vijay Chavan, Ashish Jadhav
|
| 260 |
|
|
|a London, UK
|b Academic Press
|c 2023
|
| 300 |
|
|
|a xxii, 209 pages
|b illustrations
|
| 505 |
0 |
|
|a Includes bibliographical references and index
|
| 505 |
0 |
|
|a 7.1 Objectives and outcomes -- 7.2 Applications of finite automata and regular expressions -- 7.3 Applications of grammars -- 7.4 Applications of pushdown automata -- 7.5 Applications of Turing machine -- 7.6 Concept of cellular automata -- 7.7 Chapter summary -- 7.8 Multiple choice questions -- References -- 8 Automata theory with recent trends -- 8.1 Objectives and outcomes -- 8.2 Introduction -- 8.3 Automata and cybersecurity -- 8.3.1 System software -- 8.3.2 Network testing -- 8.3.3 Protocol testing -- 8.3.4 Cloud security testing -- 8.3.5 Application testing -- 8.4 Automata and artificial intelligence (AI)/machine learning (ML) -- 8.5 Chapter summary -- 8.6 Multiple choice questions -- References -- A Answers to multiple choice questions -- B Notations -- Index -- Back Cover
|
| 505 |
0 |
|
|a 3.4 Equivalence of finite automata and regular expression -- 3.4.1 Conversion of regular expression to finite automata -- 3.4.2 Conversion of finite automata to regular expression -- 3.5 Closure properties of regular languages -- 3.6 Pumping lemma -- 3.7 Chomsky hierarchy of languages -- 3.8 Concept of grammar -- 3.8.1 String derivation from grammar -- 3.8.2 Right linear grammar -- 3.8.3 Left linear grammar -- 3.8.4 Regular grammar -- 3.8.5 Linear grammar -- 3.8.6 Conversion of regular grammar to finite automata -- 3.8.7 Conversion of finite automata into regular grammar -- 3.9 Chapter summary -- 3.10 Multiple choice questions -- 3.11 Exercises -- References -- 4 Context-free grammar -- 4.1 Objectives and outcomes -- 4.2 Context-free grammar -- 4.3 Context-free language -- 4.4 String derivations and parse trees -- 4.5 Ambiguity in CFG -- 4.6 Simplification of CFG -- 4.7 Normal forms of CFG -- 4.7.1 Chomsky normal form (CNF) -- 4.7.2 Greibach normal form (GNF) -- 4.8 Chapter summary -- 4.9 Multiple choice questions -- 4.10 Exercises -- References -- 5 Pushdown automata -- 5.1 Objectives and outcomes -- 5.2 Introduction to PDA -- 5.3 Language of PDA -- 5.4 Deterministic PDA -- 5.5 Nondeterministic PDA -- 5.6 Equivalence of CFGs and PDA -- 5.6.1 Conversion of CFG to PDA -- 5.6.2 Conversion of PDA into CFG -- 5.7 Chapter summary -- 5.8 Multiple choice questions -- 5.9 Exercises -- References -- 6 Turing machine -- 6.1 Objectives and outcomes -- 6.2 Introduction to Turing machines -- 6.2.1 Model of Turing machine -- 6.2.2 Designing Turing machines -- 6.2.3 Halting of Turing machine -- 6.3 Turing machine variants -- 6.3.1 Multitape Turing machine -- 6.3.2 Nondeterministic Turing machine -- 6.3.3 Universal Turing machine -- 6.4 Chapter summary -- 6.5 Multiple choice questions -- 6.6 Exercises -- References -- 7 Applications of automata
|
| 653 |
|
|
|a Machine theory / fast
|
| 653 |
|
|
|a Formal languages / http://id.loc.gov/authorities/subjects/sh85050802
|
| 653 |
|
|
|a Théorie des automates
|
| 653 |
|
|
|a Langages formels
|
| 653 |
|
|
|a Formal languages / fast
|
| 653 |
|
|
|a Machine theory / http://id.loc.gov/authorities/subjects/sh85079341
|
| 700 |
1 |
|
|a Jadhav, Ashish
|e author
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 015 |
|
|
|a GBC376422
|
| 776 |
|
|
|z 0323917844
|
| 776 |
|
|
|z 9780323972178
|
| 776 |
|
|
|z 9780323917841
|
| 776 |
|
|
|z 0323972179
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9780323972178/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.3
|
| 520 |
|
|
|a Automata Theory and Formal Languages presents the difficult concepts of automata theory in a straightforward manner, including discussions on diverse concepts and tools that play major roles in developing computing machines, algorithms and code. Automata theory includes numerous concepts such as finite automata, regular grammar, formal languages, context free and context sensitive grammar, push down automata, Turing machine, and decidability, which constitute the backbone of computing machines. This book enables readers to gain sufficient knowledge and experience to construct and solve complex machines. Each chapter begins with key concepts followed by a number of important examples that demonstrate the solution. The book explains concepts and simultaneously helps readers develop an understanding of their application with real-world examples, including application of Context Free Grammars in programming languages and Artificial Intelligence, and cellular automata in biomedical problems. Presents the concepts of Automata Theory and Formal Languages in an easy-to-understand approach Helps the readers understand key concepts by solving real-world examples. Provides the readers with a simple approach to connect the theory with the latest trend like software testing, cybersecurity, artificial intelligence, and machine learning. Includes a wide coverage of applications of automata theory and formal languages
|