| Description |
1 online resource |
| Contents |
Cover -- Half-title Page -- Title Page -- Copyright Page -- Contents -- Preface -- List of Notation -- PART I Problems -- 1 Words, Numbers, Graphs -- 2 Regular Languages -- 2.1 Regular Expressions and Finite Automata -- 2.2 Proving Non-Regularity -- 2.3 Closure Properties -- 2.4 Minimal Automata -- 2.5 Variants of Finite Automata -- 2.6 Combinatorics of Finite Automata -- 2.7 Algorithms on Automata -- 2.8 Stringology -- 3 Context-Free Languages -- 3.1 Context-Free Grammars -- 3.2 Context-Free or Not? -- 3.3 Pushdown Automata -- 3.4 Properties of Context-Free Languages |
|
4 Theory of Computation -- 4.1 Turing Machines -- 4.2 Computability and Undecidability -- 4.3 Chomsky Hierarchy -- 4.4 Computational Complexity -- PART II Solutions -- 5 Words, Numbers, Graphs -- 6 Regular Languages -- 7 Context-Free Languages -- 8 Theory of Computation -- Further Reading -- Index |
| Summary |
This resource presents a series of compelling exercises of increasing difficulty in formal languages, automata and computation, key topics in theoretical computer science. Comprehensive solutions are provided for all problems, making it a perfect resource for self-study, as well as a source of examples and problems for instructors |
| Notes |
Description based on online resource; title from digital title page (viewed on April 20, 2023) |
| Subject |
Machine theory.
|
|
Formal languages.
|
|
Formal languages
|
|
Machine theory
|
| Form |
Electronic book
|
| Author |
Murlak, Filip, editor.
|
|
Niwiński, Damian, editor.
|
|
Rytter, Wojciech, editor.
|
| ISBN |
9781009072632 |
|
1009072633 |
|
