Formal languages and computation: models and their applications/ (Record no. 2442)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05902cam a22001818i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781466513457 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.131 |
| Item number | MED/F |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Meduna, Alexander. |
| 245 10 - TITLE STATEMENT | |
| Title | Formal languages and computation: models and their applications/ |
| Statement of responsibility, etc. | Alexander Meduna |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Boca Raton: |
| Name of publisher, distributor, etc. | CRC Press, |
| Date of publication, distribution, etc. | 2014. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xix, 295 p. : |
| Other physical details | ill. ; |
| Dimensions | 27 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | SECTION I INTRODUCTION<br/>1 Mathematical Background<br/>1.1 Logic..<br/>1.2 Sets and Sequences.ยป.<br/>1.3 Relations.<br/>1.4 Graphs...^<br/>2 Formal Languages and Rewriting Systems..<br/>2.1 Formal Languages...<br/>2.2 Rewriting Systems...<br/>2.2.1 Rewriting Systems in General..<br/>2.2.2 Rewriting Systems as Language Models ..<br/>2.2.3 Rewriting Systems as Computational Models..<br/>2.3 Synopsis of the Book<br/>SECTION II REGULAR LANGUAGES AND THEIR MODELS<br/>3 Models for Regular Languages..<br/>3.1 Finite Automata..<br/>3.1.1 Representations of Finite Automata..<br/>3.2 Restricted Finite Automata<br/>3.2.1 Removal of e-Rules...<br/>3.2.2 Determinism.<br/>3.2.2.1 Complete Specification....<br/>3.2.3 Minimization...<br/>3.3 Regular Expressions and Their Equivalence with Finite Automata<br/>3.3.1 Regular Expressions..<br/>3.3.2 Equivalence with Finite Automata..<br/>3.3.2.1 From Finite Automata to Regular Expressions..<br/>3.3.2.2 From Regular Expressions to Finite Automata..<br/>4 Applications of Regular Expressions and Finite Automata:<br/>Lexical Analysis.<br/>4.1 Implementation of Finite Automata.<br/>4.1.1 Table-Based Implementation<br/>4.1.2 Case-Statement Implementation<br/>4.2 Introduction to Lexical Analysis<br/>4.2.1 Lexical Units and Regular Expressions.<br/>4.2.2 Scanners and Finite Automata.<br/>4.3 Implementation of a Scanner.<br/>5 Properties of Regular Languages.<br/>5.1 Pumping Lemma for Regular Languages .,<br/>5.1.1 Applications of the Pumping Lemma for Regular Languages..<br/>5.2 Closure Properties<br/>5.2.1 Applications of Closure Properties..<br/>SECTION 111 CONTEXT-FREE LANGUAGES AND THEIR MODELS<br/>6 Models for Contact-Free Languages.<br/>6.1 Context-Free Grammars<br/>6.2 Restricted Context-Free Grammars.<br/>6.2.1 Canonical Derivations and Derivation Trees.<br/>6.2.1.1 Leftmost Derivations.<br/>6.2.1.2 Rightmost Derivations..<br/>6.2.1.3 Derivation Trees<br/>6.2.1.4 Ambiguity.<br/>6.2.2 Removal of Useless Symbols<br/>6.2.3 Removal of Erasing Rules.<br/>6.2.4 Removal of Single Rules.<br/>6.2.5 Chomsky Normal Form.<br/>6.2.6 Elimination of Left Recursion<br/>6.2.7 Greibach Normal Form<br/>6.3 Pushdown Automata<br/>6.3.1 Pushdown Automata and Iheir Languages...<br/>6.3.2 Equivalence with Context-Free Grammars...<br/>6.3.2.1 From Context-Free Grammars to<br/>Pushdown Automata<br/>6.3.2.2 From Pushdown Automata to Context-Free Grammars.<br/>6.3.3 Equivalent Types of Acceptance<br/>6.3.4 Deterministic Pushdown Automata<br/>7 Applications of Models for Context-Free Languages:<br/>Syntax Analysis...<br/>7.1 I ntroduction to Syntax Analysis.<br/>7.1.1 Syntax Specified by Context-Free Grammars.<br/>7.1.2 Top-Down Parsing...<br/>7.1.3 Bottom-Up Parsing..,<br/>7.2 Top-Down Parsing<br/>7.2.1 Predictive Sets and LL Grammars<br/>7.2.1.1 LL Grammars.<br/>7.2.2 Predictive Parsing.<br/>7.2.2.1 Predictive Recursive-Descent Parsing<br/>7.2.2.2 Predictive Table-Driven Parsing.<br/>7.2.2.3 Handling Errors.<br/>7.2.2.4 Exclusion of Left Recursion.<br/>7.3 Bottom-Up Parsing..<br/>7.3.1 Operator-Precedence Parsing<br/>7.3.1.1 Operator-Precedence Parser<br/>7.3.1.2 Construction of Operator-Precedence Parsing<br/>Table.<br/>7.3.1.3 Handling Errors<br/>7.3.1.4 Operator-Precedence Parsers for Other<br/>Expressions<br/>7.3.2 LR Parsing.<br/>7.3.2.1 LR Parsing Algorithm.<br/>7.3.2.2 Construction of LR Table<br/>7.3.2.3 Handling Errors in LR Parsing<br/>8 Properties of Context-Free Langui^es<br/>8.1 Pumping Lemma for Context-Free Languages<br/>8.1.1 Applications of the Pumping Lemma.<br/>8.2 Closure Properties.<br/>8.2.1 Union, Concatenation, and Closure<br/>8.2.2 Intersection and Complement,<br/>8.2.3 Homomorphism<br/>8.2.4 Applications of the Closure Properties<br/>SECTION IV TURING MACHINES AND COMPUTATION<br/>9 Turing Machines and Their Variants.<br/>9.1 Turing Machines and Their Languages.<br/>9.2 Restricted Turing Machines .<br/>9.2.1 Computational Restrictions<br/>9.2.2 Size Restrictions ...<br/>9.3 Universal Turing Machines<br/>9.3.1 Turing Machine Codes<br/>9.3.2 Construction of Universal Turing Machines.<br/>10 Applications of Turing Machines: Iheory of Computation<br/>10.1 Computability.<br/>10.1.1 Integer Functions Computed by Turing<br/>Machines.<br/>10.1.2 Recursion Theorem<br/>10.1.3 Kleene s s-m-n Theorem.<br/>10.2 Decidability<br/>10.2.1 Turing Deciders.<br/>10.2.2 Decidable Problems..<br/>10.2.2.1 Decidable Problems for Finite Automata<br/>10.2.2.2 Decidable Problems for Context-Free Grammars<br/>10.2.3 Undecidable Problems<br/>10.2.3.1 Diagonalization.<br/>10.2.3.2 Reduction<br/>10.2.3.3 Undecidable Problems Not Concerning<br/>Turing Machines<br/>10.2.4 General Approach to Undecidability<br/>10.2.4.1 Rice's Theorem<br/>10.2.5 Computational Complexity.<br/>10.2.5.1 Time Complexity<br/>10.2.5.2 Space Complexity.<br/>11 Turing Machines and General Grammars,<br/>11.1 General Grammars and Their Equivalence with Turing<br/>Machines.<br/>11.1.1 General Grammars<br/>11.1.2 Normal Forms,<br/>11.1.3 Equivalence of General Grammars and Turing Machines.<br/>11.1.3.1 From General Grammars to Turing Machines..<br/>11.1.3.2 From Turing Machines to General Grammars..<br/>11.2 Context-Sensitive Grammars and Linear-Bounded Automata.<br/>11.2.1 Context-Sensitive Grammars and Their Normal Forms.<br/>11.2.1.1 Normal Forms<br/>11.2.2 Linear-Bounded Automata and Their Equivalence with<br/>Context-Sensitive Grammars<br/>11.2.2.1 From Context-Sensitive Grammars to Linear-Bounded<br/>Automata,<br/>11.2.2.2 From Linear-Bounded Automata to Context-Sensitive<br/>Grammars.<br/>11.2.3 Context-Sensitive Languages and Decidable Languages.<br/>11.3 Relations between Language Families<br/>SECTION V CONCLUSION<br/>12 Concluding and Bibliographical Remarks<br/>12.1 Summary.<br/>12.2 Modern Trends.<br/>12.2.1 Conditional Grammars<br/>12.2.2 Regulated Grammars.<br/>12.2.3 Scattered Context Grammars<br/>12.2.4 Grammar Systems<br/>12.3 Bibliographical and Historical Remarks, |
| 650 #0 - SUBJECT | |
| Keyword | Formal languages. |
| 650 #0 - SUBJECT | |
| Keyword | Machine theory. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | General Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Date last checked out | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 08/06/2016 | 005.131 MED/F | P41462 | 19/06/2023 | 30/05/2023 | General Books |