# TOC

## Introduction to Automata Theory

Automata Theory is a branch of theoretical computer science that deals with the study of abstract machines and computational problems. It was introduced by mathematicians … Read more

## Remove ∈ transitions from NFA

RGPV PYQs Solution. Step 01: Find ∈-closure of (q1), (q2) and (q3). For each state find the next state for each input. See the table … Read more

## Pushdown Automata

A Pushdown automata (PDA) works similar as DFA. A DFA can remember a finite amount of information, but a PDA can remember an infinite amount … Read more

## Diiference between Mealy and Moore machine

Mealy machine has 6 tuples: (Q, q0, ∑, O, δ, λ’) Moore machine has 6 tuples: (Q, q0, ∑, O, δ, λ’) Mealy machine vs … Read more

## Moore to Mealy machine

To convert a Moore machine into an equivalent Mealy machine, we need to modify the transition function so that it takes an input symbol and … Read more

## Mealy to Moore Machine

Mealy Machine to Moore Machine Conversion Mealy machine for an input string of length ‘n’, Transition table for Mealy machine. PRESENT STATE NEXT STATE INPUT … Read more

## Properties of transition functions

RGPV 2015 PYQQ. State and explain the properties of transition functions ? Ans. A transition function is defined on every state for every input symbol. … Read more

## Equivalent of DFA and NFA

RGPV 2010, 02 Q. Write short note on equivalent of DFA and NDFA ? Solution: Every DFA is an NDFA. If from a regular set … Read more