Automata theory and formal languages / Władysław Homenda, Witold Pedrycz.
Material type: TextSeries: De Gruyter graduatePublisher: Berlin ; Boston : De Gruyter, ©2022Copyright date: ©2022Description: xiii, 231 pages : illustrations ; 24 cmContent type:- text
- still image
- unmediated
- volume
- 9783110752274 (paperback)
- 004.015113 23 HOM-A
Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
Books | Junaid Zaidi Library, COMSATS University Islamabad Ground Floor | Books | 004.05113 HOM-A 63440 (Browse shelf(Opens below)) | Available | Paperback. | 10001000063440 |
Includes bibliographical references (page 227) and index.
PART I: GRAMMARS AND GENERATING LANGUAGES -- 2. Regular expressions and regular languages -- 3. Context-free grammars -- 4. Context-sensitive grammars and unrestricted grammars -- PART II: AUTOMATA AND ACCEPTING LANGUAGES -- 5. Turing machines -- 6. Pushdown automata -- 7. Finite automata -- PART III: REVISITED: LANGUAGES, GRAMMARS, AUTOMATA -- 8. Grammar versus automata -- 9. Around the hierarchy of languages.
"The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students."-- Back cover.
There are no comments on this title.