Automata
Chapter 4. Properties of Regular Languages
4. Properties of Regular Languages
How general are regular languages? Closure question? Finite or not? Membership? Nature or characteristics of regu
Automata
Chapter 5. Context-Free Languages
5. Context-Free Languages
With L=cfw_anbn : n 0, Let h(a) = (, h(b) = ) Then () and () are in L. Nested structure in programming languages. We need something
Automata
Chapter 6. Simplification of ContextFree Grammars and Normal Forms
Chapter 6 Simplification of ContextFree Grammars and Normal Forms
Simplify context-grammars: Remove useless variables and pr
Automata
Chapter 7. Pushdown Automata
Chpater 7 Pushdown Automata
Automata for context-free languages? - can count without limit. i.e., L=cfw_anbn| n 0 - Store and match a sequence of symbols in rever
Automata
Chapter 8. Properties of Context-Free Languages
Chapter 8. Properties of Context-Free Languages
Closure property Membership Classifying languages
8.1 Two Pumping Lemmas
A pumping lemma for co
Automata
Chapter 9. Turing Machines
Chapter 9. Turing Machines
There are some L: not context-free, such as cfw_anbncn and cfw_ww. New language families? Different type of storages? The most powerful o