Amazon cover image
Image from Amazon.com

Languages and machines : an introduction to the theory of computer science / Thomas A. Sudkamp.

By: Material type: TextPublication details: Reading, Mass. : Addison-Wesley Pub., c1997.Edition: 2nd edDescription: xv, 569 p. : ill. ; 24 cmISBN:
  • 0201821362
ISSN:
  • 9780201821369
Subject(s): LOC classification:
  • QA267.3 .S83
Contents:
pt I. Foundations. Mathematical preliminaries -- Languages -- pt. II. Context-free grammars and parsing. Context-free grammars -- Parsing; an introduction -- Normal forms -- pt. III. Automata and languages. Finite automata -- Regular languages and sets -- Pushdown automata and context-free languages -- Turing machines -- The Chomsky hierarchy -- pt. IV. Decidability and computability. Decidability -- Numeric computation -- Mu-recursive functions -- pt. V. Computational complexity. Computational complexity -- Tractability and NP-complete problems -- pt. VI. Deterministic parsing. LL(k) grammars -- LR(k) grammars -- Appendix I. Index of notation -- Appendix II. The Greek alphabet -- Appendix III. Backus-Naur definition of Pascal.
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Books Methodist University Library Main General Stacks Reference QA267.3 .S83 (Browse shelf(Opens below)) Available 27566

Includes bibliographical references and index

pt I. Foundations. Mathematical preliminaries --
Languages --
pt. II. Context-free grammars and parsing. Context-free grammars --
Parsing; an introduction --
Normal forms --
pt. III. Automata and languages. Finite automata --
Regular languages and sets --
Pushdown automata and context-free languages --
Turing machines --
The Chomsky hierarchy --
pt. IV. Decidability and computability. Decidability --
Numeric computation --
Mu-recursive functions --
pt. V. Computational complexity. Computational complexity --
Tractability and NP-complete problems --
pt. VI. Deterministic parsing. LL(k) grammars --
LR(k) grammars --
Appendix I. Index of notation --
Appendix II. The Greek alphabet --
Appendix III. Backus-Naur definition of Pascal.

There are no comments on this title.

to post a comment.
Share
Copyright © 2026  MUG Library