Scribd
Upload
200 views1 page

Finite State Models: Language Definitions Preliminaries, Regular

Theory of Automata and Formal Languages is a 3 credit hour course with no labs that has Discrete Mathematical Structures as a prerequisite. The course aims to develop an appreciation of the theoretical foundations of computer science through studying abstract models of computers and the theory of formal languages. The course outline covers finite state models, grammars and pushdown automata, and Turing machines theory, examining topics like regular expressions, finite automata, context-free grammars, pumping lemmas, and the Chomsky hierarchy of grammars.

Uploaded by

AhmadUllah Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
200 views1 page

Finite State Models: Language Definitions Preliminaries, Regular

Theory of Automata and Formal Languages is a 3 credit hour course with no labs that has Discrete Mathematical Structures as a prerequisite. The course aims to develop an appreciation of the theoretical foundations of computer science through studying abstract models of computers and the theory of formal languages. The course outline covers finite state models, grammars and pushdown automata, and Turing machines theory, examining topics like regular expressions, finite automata, context-free grammars, pumping lemmas, and the Chomsky hierarchy of grammars.

Uploaded by

AhmadUllah Ahmad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Course Name: Theory of Automata and Formal Languages

Course Structure: Lectures: 3 / Labs: 0 Credit Hours: 3


Prerequisites: Discrete Mathematical Structures
Objectives:
The course aims to develop an appreciation of the theoretical foundations
of computer science through study of mathematical & abstract Models of
computers and the theory of formal languages. Theory of formal languages and
use of various abstract machines as ‘recognizers’ and parsing will be Studied
for identifying/validating the synthetic characteristics of programming
Languages. Some of the abstract machines shall also study as ‘Transducers’.

Course Outline:
Finite State Models: Language definitions preliminaries, Regular
expressions/Regular languages, Finite automata (FAs), Transition graphs
(TGs), NFAs, kleene’s theorem, Transducers (automata with output),
Pumping lemma and non-regular language Grammars and PDA: Context free
grammars, Derivations, derivation trees and ambiguity, Simplifying CFLs ,
Normal form grammars and parsing, Push-down Automata, Pumping lemma
and non-context free languages, Decidability, Chom sky’s hierarchy of
grammars Turing Machines Theory: Turing machines, Post machine, Variations
on TM, TM encoding, Universal Turing Machine, Context sensitive
Grammars, Defining Computers by TMs.
Reference Material:
Introduction to Computer Theory, Denial Cohen, John Wiley & Sons, Inc.
Introduction to Automata Theory, Languages and Computation, J Hopcraft, D.
Ullman. Languages and Machines, An Into to the Theory of Comp. Sc., 2/e Thomas
A. Sudkamp, Addison Wesley.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy