CMPE 585 Theory of Sequential Machines (3+0+0) 3
Bingol - 2006 Spring


Home & News
Syllabus
Contact Us
Homeworks & ToDo
Grades

Syllabus

InstructorDr. Haluk Bingöl, bingol@boun.edu.tr, x7121, HKC 213
Assistant-
Web Sitehttp://www.cmpe.boun.edu.tr/courses/cmpe585
Time/RoomLectures: FFF 678 / HKD 219
First Meeting03.03.2006/14:00
Text Book Switching and Finite Automata Theory, 2e
Kohavi
McGrawHill, 1978, [QA267.5 S4 K64]
Grading 25% Midterm #1
20% Paper
20% Contribution to discussions & homeworks & attendance
35% Final
Course Outline Logic Design courses cover the Engineering aspects of sequential machines. The theory behind Finite State Machines is usually left behind. This course gives an opportunity to see Discrete Math, Graph Theory in working.
Topics
  • Review of discrete math
  • Review of sequential machines
  • Structure theory of sequential machines (ch12)
  • State-identification, fault detection, ... (ch13)
  • Memory, definiteness (ch14)
  • Information losslessness
  • Linear sequential machines (ch15)
PrerequisitesSolid background on Discrete Mathematics, Theory of Computation.
References

Introduction to Discrete Structures
Preparata & Yeh
Addison-Wesley, 1973, [QA162.P7]

Applied Abstruct Algebra
Lidl & Pils
Springer-Verlag, 1984, [QA162.L53]

System Theory
Zadeh & Polak
Addison-Wesley, 1969, [QA402 Z32]

Introduction to Switching and Automata Theory
Harrison
McGraw-Hill, 1965, [QA401 H33]

Algebraic Structure Theory of Sequential Machines
Hartmanis & Stearns
Prentice-Hall, 1966 [QA267.5 S4 H3]

Machines, Languages and Computation
Denning, Dennis & Qualits
Prentice-Hall, 1978, [QA267 D45]

 
[http://www.cmpe.boun.edu.tr/courses/?cmpe=585   updated:20060428]