 BROWSE
 USED
 STAFF PICKS
 GIFTS + GIFT CARDS
 SELL BOOKS
 BLOG
 EVENTS
 FIND A STORE
 800.878.7323

$14.95
New Trade Paper
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for Instore Pickup
in 7 to 12 days
More copies of this ISBNOther titles in the Dover Books on Advanced Mathematics series:
Introduction to Formal Languages (Dover Books on Advanced Mathematics)by Gyorgy E. Revesz
Synopses & ReviewsPublisher Comments:This highly technical introduction to formal languages in computer science covers all areas of mainstream formal language theory, including such topics as operations on languages, contextsensitive languages, automata, decidability, syntax analysis, derivation languages, and more. Geared toward advanced undergraduates and graduate students, the treatment examines mathematical topics related to mathematical logic, set theory, and linguistics. All subjects are integral to the theory of computation. Numerous worked examples appear throughout the book, and endofchapter exercises enable readers to apply theory and methods to reallife problems. Elegant mathematical proofs are provided for almost all theorems. Synopsis:Covers all areas, including operations on languages, contextsensitive languages, automata, decidability, syntax analysis, derivation languages, and more. Numerous worked examples, problem exercises, and elegant mathematical proofs. 1983 edition.
Synopsis:Accessible introduction to mainstream formal language theory: operations on languages, contextsensitive languages, automata, syntax analysis, derivation languages, much more. Worked examples. Exercises. Description:Includes bibliographical references (p. 192195) and index.
Table of ContentsPreface
Chapter 1. The Notion of Formal Language 1.1 Basic Concepts and Notations 1.2 The Chomsky Hierarchy of Languages Chapter 2. Operations on Languages 2.1 Definitions of Operations on Languages 2.2 Closure Properties of Language Classes Chapter 3. ContextFree Languages 3.1 The Chomsky Normal Form 3.2 Derivation Tree 3.3 Linear Grammars and Regular Languages 3.4 Griebach Normal Form 3.5 Regular Expressions Chapter 4. ContextSensitive Languages 4.1 LengthIncreasing Grammars 4.2 Kuroda Normal Form 4.3 OneSided ContextSensitive Grammars Chapter 5. Unrestricted PhraseStructure Languages 5.1 A Normal Form for Type O Grammars 5.2 Derivation Graph Chapter 6. Automata and Their Languages 6.1 Finite Automata 6.2 Pushdown Automata 6.3 TwoPushdown Automata 6.4 Turing Machines Chapter 7. Decidability 7.1 Recursive and Recursively Enumerable Languages 7.2 The ChurchTuring Thesis 7.3 Undecidable Problems Chapter 8. Complexity of Computations 8.1 Deterministic and Nondeterministic Procedures 8.2 Measures of Complexity 8.3 Complexity of ContextFree Language Recognition 8.4 The Hardest ContextFree Language Chapter 9. Syntax Analysis 9.1 The Connection between Syntax and Semantics 9.2 Ambiguity 9.3 Earley's Algorithm 9.4 LL(k) and LR(k) Grammars Chapter 10. Derivation Languages 10.1 Operations on Derivations 10.2 Derivation Words 10.3 Algebraic Properties of the Fundamental Operations 10.4 Canonical Derivations and Graph Traversals 10.5 The ContextSensitivity of Derivation Languages 10.6 Derivations in ContextSensitive Grammars Appendix. Elements of Set Theory Bibliographic Notes; References; Index What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Other books you might likeRelated Subjects
Computers and Internet » Software Engineering » Programming and Languages


