Normal view MARC view ISBD view

An Inroduction to Formal Languages and Automata (Record no. 6507)

MARC details
000 -LEADER
fixed length control field	05503nam a22001577a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	210120b \|\|\|\|\| \|\|\|\| 00\| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	978-93-84323-21-9
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Edition number	23
Classification number	005.131
Item number	LIN
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name	Linz Peter
245 ## - TITLE STATEMENT
Title	An Inroduction to Formal Languages and Automata
Statement of responsibility, etc.	Peter Linz
Medium	English6th
250 ## - EDITION STATEMENT
Edition statement	6th ed
Remainder of edition statement	2018
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc.	New Delhi
Name of publisher, distributor, etc.	Jones & Bartlett
Date of publication, distribution, etc.	2018
300 ## - PHYSICAL DESCRIPTION
Extent	449p. ;
Other physical details	Soft Bound
Dimensions	16.8*23 cm
505 ## - FORMATTED CONTENTS NOTE
FORMATTED CONTENTS NOTE	1. Introduction to the Theory of Computation<br/>1.1. Mathematical Preliminaries and Notation<br/>Sets<br/>Functions and Relations<br/>Graphs and Trees<br/>Proof Techniques<br/>1.2. Three Basic Concepts<br/>Languages<br/>Grammars<br/>Automata<br/>1.3. Some Applications<br/>2. Finite Automata<br/>2.1. Deterministic Finite Accepters<br/>Deterministic Accepters and Transition Graphs<br/>Languages and Dfa's<br/>Regular Languages<br/>2.2. Nondeterministic Finite Accepters<br/>Definition of a Nondeterministic Accepter<br/>Why Nondeterminism?<br/>2.3. Equivalence of Deterministic and Nondeterministic Finite Accepters<br/>2.4. Reduction of the Number of States in Finite Automata<br/>3. Regular Languages and Regular Grammars<br/>3.1. Regular Expressions<br/>Formal Definition of a Regular Expression<br/>Languages Associated with Regular Expressions<br/>3.2. Connection Between Regular Expressions and Regular Languages<br/>Regular Expressions Denote Regular Languages<br/>Regular Expressions for Regular Languages<br/>Regular Expressions for Describing Simple Patterns<br/>3.3. Regular Grammars<br/>Right- and Left-Linear Grammars<br/>Right-Linear Grammars Generate Regular Languages<br/>Right-Linear Grammars for Regular Languages<br/>Equivalence of Regular Languages and Regular Grammars<br/>4. Properties of Regular Languages<br/>4.1. Closure Properties of Regular Languages<br/>Closure under Simple Set Operations<br/>Closure under Other Operations<br/>4.2. Elementary Questions about Regular Languages<br/>4.3. Identifying Nonregular Languages<br/>Using the Pigeonhole Principle<br/>A Pumping Lemma<br/>5. Context-Free Languages<br/>5.1. Context-Free Grammars<br/>Examples of Context-Free Languages<br/>Leftmost and Rightmost Derivations<br/>Derivation Trees<br/>Relation between Sentential Forms and Derivation Trees<br/>5.2. Parsing and Ambiguity<br/>Parsing and Membership<br/>Ambiguity in Grammars and Languages<br/>5.3. Context-Free Grammars and Programming Languages<br/>6. Simplification of Context-Free Grammars and Normal Forms<br/>6.1. Methods for Transforming Grammars<br/>A Useful Substitution Rule<br/>Removing Useless Productions<br/>Removing [lambda]-Productions<br/>Removing Unit-Productions<br/>6.2. Two Important Normal Forms<br/>Chomsky Normal Form<br/>Greibach Normal Form<br/>6.3. A Membership Algorithm for Context-Free Grammars<br/>7. Pushdown Automata<br/>7.1. Nondeterministic Pushdown Automata<br/>Definition of a Pushdown Automaton<br/>The Language Accepted by a Pushdown Automaton<br/>7.2. Pushdown Automata and Context-Free Languages<br/>Pushdown Automata for Context-Free Languages<br/>Context-Free Grammars for Pushdown Automata<br/>7.3. Deterministic Pushdown Automata and Deterministic Context-Free Languages<br/>7.4. Grammars for Deterministic Context-Free Languages<br/>8. Properties of Context-Free Languages<br/>8.1. Two Pumping Lemmas<br/>A Pumping Lemma for Context-Free Languages<br/>A Pumping Lemma for Linear Languages<br/>8.2. Closure Properties and Decision Algorithms for Context-Free Languages<br/>Closure of Context-Free Languages<br/>Some Decidable Properties of Context-Free Languages<br/>9. Turing Machines<br/>9.1. The Standard Turing Machine<br/>Definition of a Turing Machine<br/>Turing Machines as Language Accepters<br/>Turing Machines as Transducers<br/>9.2. Combining Turing Machines for Complicated Tasks<br/>9.3. Turing's Thesis<br/>10. Other Models of Turing Machines<br/>10.1. Minor Variations on the Turing Machine Theme<br/>Equivalence of Classes of Automata<br/>Turing Machines with a Stay-Option<br/>Turing Machines with Semi-Infinite Tape<br/>The Off-Line Turing Machine<br/>10.2. Turing Machines with More Complex Storage<br/>Multitape Turing Machines<br/>Multidimensional Turing Machines<br/>10.3. Nondeterministic Turing Machines<br/>10.4. A Universal Turing Machine<br/>10.5. Linear Bounded Automata<br/>11. A Hierarchy of Formal Languages and Automata<br/>11.1. Recursive and Recursively Enumerable Languages<br/>Languages That Are Not Recursively Enumerable<br/>A Language That Is Not Recursively Enumerable<br/>A Language That Is Recursively Enumerable but Not Recursive<br/>11.2. Unrestricted Grammars<br/>11.3. Context-Sensitive Grammars and Languages<br/>Context-Sensitive Languages and Linear Bounded Automata<br/>Relation Between Recursive and Context-Sensitive Languages<br/>11.4. The Chomsky Hierarchy<br/>12. Limits of Algorithmic Computation<br/>12.1. Some Problems That Cannot Be Solved by Turing Machines<br/>Computability and Decidability<br/>The Turing Machine Halting Problem<br/>Reducing One Undecidable Problem to Another<br/>12.2. Undecidable Problems for Recursively Enumerable Languages<br/>12.3. The Post Correspondence Problem<br/>12.4. Undecidable Problems for Context-Free Languages<br/>12.5. A Question of Efficiency<br/>13. Other Models of Computation<br/>13.1. Recursive Functions<br/>Primitive Recursive Functions<br/>Ackermann's Function<br/>[micro] Recursive Functions<br/>13.2. Post Systems<br/>13.3. Rewriting Systems<br/>Matrix Grammars<br/>Markov Algorithms<br/>L-Systems<br/>14. An Overview of Computational Complexity<br/>14.1. Efficiency of Computation<br/>14.2. Turing Machine Models and Complexity<br/>14.3. Language Families and Complexity Classes<br/>14.4. The Complexity Classes P and NP<br/>14.5. Some NP Problems<br/>14.6. Polynomial-Time Reduction<br/>14.7. NP-Completeness and an Open Question<br/>Answers<br/>References<br/>Index
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme	Dewey Decimal Classification
Koha item type	Books

Holdings
Withdrawn status	Lost status	Source of classification or shelving scheme	Damaged status	Not for loan	Collection code	Home library	Current library	Shelving location	Date acquired	Cost, normal purchase price	Full call number	Barcode	Date last seen	Price effective from	Koha item type
		Dewey Decimal Classification			Non-fiction	Tetso College Library	Tetso College Library	Computer Science	20/01/2021	495.00	005.131 LIN	10495	20/01/2021	20/01/2021	Books