Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Dover Books on Mathematics Ser.: Introduction to Formal Languages by Gyorgy E. Revesz (2012, Trade Paperback)
Rarewaves (623802)
97.8% positive feedback
Price:
US $21.49
ApproximatelyRM 91.48
+ $3.99 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherDover Publications, Incorporated
ISBN-100486666972
ISBN-139780486666976
eBay Product ID (ePID)936247
Product Key Features
Number of Pages208 Pages
Publication NameIntroduction to Formal Languages
LanguageEnglish
Publication Year2012
SubjectLogic, Linguistics / General
TypeTextbook
Subject AreaMathematics, Language Arts & Disciplines
AuthorGyorgy E. Revesz
SeriesDover Books on Mathematics Ser.
FormatTrade Paperback
Dimensions
Item Weight8.8 Oz
Item Length11 in
Item Width8.3 in
Additional Product Features
Intended AudienceCollege Audience
LCCN91-011606
Dewey Edition20
Dewey Decimal511.3
Table Of ContentPrefaceChapter 1. The Notion of Formal Language 1.1 Basic Concepts and Notations 1.2 The Chomsky Hierarchy of LanguagesChapter 2. Operations on Languages 2.1 Definitions of Operations on Languages 2.2 Closure Properties of Language ClassesChapter 3. Context-Free 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 ExpressionsChapter 4. Context-Sensitive Languages 4.1 Length-Increasing Grammars 4.2 Kuroda Normal Form 4.3 One-Sided Context-Sensitive GrammarsChapter 5. Unrestricted Phrase-Structure Languages 5.1 A Normal Form for Type O Grammars 5.2 Derivation GraphChapter 6. Automata and Their Languages 6.1 Finite Automata 6.2 Pushdown Automata 6.3 Two-Pushdown Automata 6.4 Turing MachinesChapter 7. Decidability 7.1 Recursive and Recursively Enumerable Languages 7.2 The Church-Turing Thesis 7.3 Undecidable ProblemsChapter 8. Complexity of Computations 8.1 Deterministic and Nondeterministic Procedures 8.2 Measures of Complexity 8.3 Complexity of Context-Free Language Recognition 8.4 The Hardest Context-Free LanguageChapter 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) GrammarsChapter 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 Context-Sensitivity of Derivation Languages 10.6 Derivations in Context-Sensitive GrammarsAppendix. Elements of Set TheoryBibliographic Notes; References; Index
SynopsisThis carefully written introductory treatment covers all areas of mainstream formal language theory, including operations on languages, context-sensitive languages, automata, decidability, and syntax analysis, as well as the first complete discussion of derivation languages. It features numerous worked examples, problem exercises, and elegant mathematical proofs for almost all theorems. 1983 edition., 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, context-sensitive 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 end-of-chapter exercises enable readers to apply theory and methods to real-life problems. Elegant mathematical proofs are provided for almost all theorems.Reprint of the McGraw-Hill Book Company, New York, 1983 edition., Covers all areas, including operations on languages, context-sensitive languages, automata, decidability, syntax analysis, derivation languages, and more. Numerous worked examples, problem exercises, and elegant mathematical proofs. 1983 edition., Accessible introduction to mainstream formal language theory: operations on languages, context-sensitive languages, automata, syntax analysis, derivation languages, much more. Worked examples. Exercises.
LC Classification NumberQA267.3.R485 1991
Be the first to write a review
