Skip to content

Home
Tutorials
Papers
MCQs
Contact

PDA for Regular Languages in theory of automata
By: Prof. Dr. Fazal Rehman | Last updated: March 3, 2022

PDA for ending with a:

Accepted Strings: a, ba, aba, aaa, bba, abba,……etc. Rejected Strings: b, ba, abb,…….etc.

atomata

List of All examples of Push Down Automata (PDA): Click Here .

Related Posts:

Push down automata PDA for b twice in theory of automata
Turing machine for Regular languages in theory of automata
Deterministic PDA vs Non-deterministic PDA MCQs
PDA for unequal a's and b's in theory of automata
PDA for a,bnanbm in theory of automata
PDA for the language of strings where a is greater than b in theory of automata

Leave a Comment

You must be logged in to post a comment.

Theory Of Automata

Theory Of Automata
MCQS
Past Papers(Guess)
Alphabets, Strings, Words & basics
Descriptive definition
Recursive definition
Regular Expression
- Exercise on Regular Expression – 100+ Examples
What is meaning of Epsilon or Null?
Finite Automata
- Exercise on Finite Automata – 100+ Examples
What is a dead state?
FA to RE Conversion
Transition Table
NFA
Push Down Automata – PDA
Turing Machine TM
- Exercise on Turing Machine 30+Examples
TM – Regular languages
List of important Turing Machines in Automata
Recursively enumerable languages
Context Free Grammer CFG
- Exercise on Context Free Grammer CFG
Regular Expression conversion to CFG
Chomsky normal Form and Examples
Algebraic Laws for Regular Expressions RegEx
RegExp of strings Contains at least three 1s
Video Lectures
MCQs
Computer Science Research Topics for MS PhD

MCQs – Computer Science
MCQs – English
MCQs – Biology
MCQs – Everyday Science
MCQs – General Knowledge
MCQs – Islamic studies
MCQs – Maths
MCQs – Physics
MCQs – Geography
MCQs – Economics
MCQs – Statistics
MCQs – Ethics
MCQs – Management Sciences
MCQs – Social Studies
Engineering MCQs
[1000+] Psychology MCQs
Laser marking MCQs
Analogy MCQs

Search for:

All Copyrights Reserved 2025 Reserved by T4Tutorials