Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
lat:homework [2009/11/27 22:48] barbara.jobstmann |
lat:homework [2009/11/27 22:50] barbara.jobstmann |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| ====== LAT Homework ====== | ====== LAT Homework ====== | ||
| - | == 02.10.2009: == | + | ===== 02.10.2009: ===== |
| Consider the automata construction from proof of the Myhill-Nerode theorem for a language L. Prove | Consider the automata construction from proof of the Myhill-Nerode theorem for a language L. Prove | ||
| * (a) the constructed automaton A is the minimal automaton (in the number of states) that recognizes L; | * (a) the constructed automaton A is the minimal automaton (in the number of states) that recognizes L; | ||