First Page | Document Content | |
---|---|---|
Date: 2003-11-21 17:50:43Mathematics Computer science Pumping lemma for regular languages Deterministic finite automaton Nondeterministic finite automaton Pumping lemma for context-free languages Regular language Regular expression String Formal languages Automata theory Theoretical computer science | ICS 162 – Fall 2003 – Midterm Name: Solution Key Student ID: 1: 30Add to Reading ListSource URL: www.ics.uci.eduDownload Document from Source WebsiteFile Size: 55,50 KBShare Document on Facebook |