Access over 20 million homework & study documents

Course outline

Content type
User Generated
Rating
Showing Page:
1/1
Course Outline
Course Name: Theory of Automata
Credit Hours: 3(3-0)
Prerequisite: None
Language definitions preliminaries, Recursive Definitions, Regular expressions, Regular
languages, Finite automata (FAs), Transition graphs (TGs), GTG, Kleene’s theorem, NFAs,
NFA and Kleene’s Theorem, Non-Regular Languages, Finite Automata with output (Moore
Machine and Mealy Machine), Pumping lemma, Decidability, CFGs, derivation trees and
ambiguity, PDA, Turing machines.
Reference Material:
1. Introduction to computer theory, Daniel I. A. Cohen, 2nd Edition.
2. Automata, Computability and Complexity: Theory and Applications, by Elaine Rich,
2011.
3. http://www.jflap.org/tutorial/

Sign up to view the full document!

lock_open Sign Up
Unformatted Attachment Preview
Course Outline Course Name: Theory of Automata Credit Hours: 3(3-0) Prerequisite: None Language definitions preliminaries, Recursive Definitions, Regular expressions, Regular languages, Finite automata (FAs), Transition graphs (TGs), GTG, Kleene’s theorem, NFAs, NFA and Kleene’s Theorem, Non-Re ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Anonymous
Awesome! Perfect study aid.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4