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.
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.
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.
Gyorgy Revesz is Professor Emeritus in the Department of Computer Science at the University of North Carolina at Charlotte.
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.
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.