Automata Theory and Formal Languages. (Record no. 25595)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04862nam a22003493i 4500 |
| 001 - CONTROL NUMBER | |
| control field | EBC5125103 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | MiAaPQ |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20190105120443.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION | |
| fixed length control field | m o d | |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cnu|||||||| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 181231s2012 xx o ||||0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9789332510319 |
| Qualifying information | (electronic bk.) |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (MiAaPQ)EBC5125103 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (Au-PeEL)EBL5125103 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (CaONFJC)MIL476026 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)1024271760 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | MiAaPQ |
| Language of cataloging | eng |
| Description conventions | rda |
| -- | pn |
| Transcribing agency | MiAaPQ |
| Modifying agency | MiAaPQ |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Edition number | 23 |
| Classification number | 005.131 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Kandar, Shyamalendu. |
| 245 10 - TITLE STATEMENT | |
| Title | Automata Theory and Formal Languages. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 0 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (377 pages) |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Cover -- About the Author -- Contents -- Foreword -- Preface -- Acknowledgements -- Chapter 1: Finite State Machine -- 1.1 Basics of Automata -- 1.2 Finite State Machine -- 1.3 State Equivalence and Minimization of Machine -- 1.4 Incompletely Specified Machine and Minimal Machine -- 1.5 Merger Graph and Compatibility Graph -- 1.6 Finite Memory and Definite Memory Machine -- 1.7 Information Lossless Machine and Inverse Machine -- 1.8 Inverse Machine -- What We Have Learned So Far -- Solved Problems -- Multiple Choice Questions -- Exercises -- Fill in the Blanks -- Answers -- Chapter 2: Language and Grammar -- 2.1 Basic Terminology and Definitions -- 2.2 Grammar and Language -- 2.3 Chomsky Hierarchy -- 2.4 Examples -- 2.5 Context-sensitive Grammar -- What We Have Learned So Far -- Solved Problems -- Multiple Choice Questions -- Exercises -- Fill in the Blanks -- Answers -- Chapter 3: Finite Automata -- 3.1 Basics About Finite Automata -- 3.2 Transitional System -- 3.3 Deterministic Finite Automata and Non-Deterministic Finite Automata -- 3.4 NFA with Null Move -- 3.5 Dead State -- 3.6 Finite Automata with Output -- 3.7 Conversion of Moore To Mealy Machine by Tabular Format -- 3.8 Conversion of Mealy to Moore Machine by Tabular Format -- 3.9 Conversion of Moore to Mealy Machine by Transitional Format -- 3.10 Conversion of Mealy to Moore Machine by Transitional Format -- 3.11 Minimization of Finite Automata -- 3.12 Myhill-Nerode Theorem -- What We Have Learned So Far -- Solved Problems -- Multiple Choice Questions -- Exercises -- Fill in the Blanks -- Answers -- Chapter 4: Regular Expression -- 4.1 Basics of Regular Expression -- 4.2 Arden Theorem -- 4.3 Construction of Finite Automata Equivalent to a Regular Expression -- 4.4 NFA With (Qc(B Move and Conversion to DFA By (Qc(B - Closure Method. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 4.5 Equivalence of Two Finite Automata and Two Regular Expressions -- 4.6 Construction of Regular Grammar from a Regular Expression -- 4.7 Pumping Lemma and its Application -- 4.8 Closure Properties of Regular Set -- What We Have Learned So Far -- Solved Problems -- Multiple Choice Questions -- Exercises -- Fill in the Blanks -- Answers -- Chapter 5: Context Free Grammar -- 5.1 Context Free Grammar: Definition and Examples -- 5.2 Derivation and Parse Tree -- 5.3 Ambiguity -- 5.4 Left Recursion and Left Factoring -- 5.5 Simplification of CFG -- 5.6 Normal Form -- 5.7 Constructing FA from Regular Grammar -- 5.8 Closure Properties of CFL -- 5.9 Pumping Lemma for CFL -- 5.10 Ogden's Lemma for CFL -- 5.11 Decision Algorithms -- What We Have Learned So Far -- Solved Problems -- Multiple Choice Questions -- Exercises -- Fill in the Blanks -- Answer -- Chapter 6: Pushdown Automata -- 6.1 Basics of Pushdown Automata -- 6.2 Acceptance by a PDA -- 6.3 Examples -- 6.4 Deterministic PDA and Non-Deterministic PDA -- 6.5 Pushdown Automata from Context Free Grammar -- 6.6 Graphical Notation for PDA -- What We Have Learned So Far -- Solved Problems -- Multiple Choice Questions -- Exercises -- Fill in the Blanks -- Answers -- Chapter 7: Turing Machine -- 7.1 Basic of Turing Machine -- 7.2 Examples -- 7.3 Transitional Representation of Turing Machine -- What We Have Learned so Far -- Solved Problems -- Multiple Choice Questions -- Exercises -- Fill in the Blanks -- Answers -- References -- Index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | The organized and accessible format of Automata Theory and Formal Languages allows students to learn important concepts in an easy-to-understand, question-and-answer format. This portable learning tool has been designed as one-stop references for students to understand and master the subjects by themselves. |
| 590 ## - LOCAL NOTE (RLIN) | |
| Local note | Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2018. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| Main entry heading | Kandar, Shyamalendu |
| Title | Automata Theory and Formal Languages |
| Place, publisher, and date of publication | Noida : Pearson India,c2012 |
| 797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN) | |
| Corporate name or jurisdiction name as entry element | ProQuest (Firm) |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://ebookcentral.proquest.com/lib/cethalassery/detail.action?docID=5125103">https://ebookcentral.proquest.com/lib/cethalassery/detail.action?docID=5125103</a> |
| Public note | Click to View |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Books |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Materials specified (bound volume or other part) | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | Online access | CENTRAL LIBRARY | Digital Library | Digital Library | 05/01/2019 | 005.131 | E0044 | 05/01/2019 | 05/01/2019 | E- Books |