EE546Graduate
Switching and Automata Theory II
Printed in the catalogue as SWITCHING AND AUTOMATA THEORY II
Course content
Information lossless machines. Codes. Unique decodability. Introduction to formal languages. Context-free and context-sensitive languages. Turing machines. Computability; decidability; unsolvability.
More in EE
- EE100Introduction to Electrical Engineering
- EE101Introduction to Electrical and Electronics Engineering
- EE201Circuit Theory I
- EE202Circuit Theory II
- EE209Fundamentals of Electrical&electro. En
- EE212Semiconductor Devices& Modeling
- EE213Electrical Circuits Laboratory
- EE214Electronic Circuits Laboratory