Automata theory and formal languages /
Władysław Homenda, Witold Pedrycz.
- xiii, 231 pages : illustrations ; 24 cm.
- De Gruyter graduate .
- De Gruyter graduate. .
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."--