Construct DFA equivalent to NFA | RGPV TOC PYQ
RGPV 2014Q. Construct DFA equivalent to the NFAM = ({p, q, r, s}, {0, 1}, δ, p, {q, s})Where δ is defined in the following table. δ … Read more
TOC
Define Mealy and Moore Machine
RGPV 2010 Q. Formally define the following (with example)- 1. Mealy machine 2. Moore machine 1. Mealy machine: Mealy machine is a six tuple machine.M = … Read more
RGPV Define Mealy and Moore Machine
RGPV 2010Q. Formally define the following (with example)- Mealy machine Moore machine 1. Mealy machine: Mealy machine is a six tuple machine. M = (Q, … Read more
RGPV TOC Short note on equivalent of DFA and NFA
RGPV 2010, 02Q. Write short note on equivalent of DFA and NDFA ? Ans. Every DFA is an NDFA. If from a regular set an … Read more
RGPV notes Write short note on NDFA
RGPV 2002Q. Write a short note on non-deterministic finite automta ? Ans. Non deterministic finite automata refere as NDFA or NFA allows a set of … Read more
RGPV TOC What do you understand by DFA how to represent it
RGPV 2015,14,02,03Q. What do you understand by DFA (Deterministic Finite Automata) and how is it represented ? Ans. A DFA means Deterministic finite automata or … Read more
What is Regular Expression
RGPV PYQs Q. What is a regular expression? Solution. The language accepted by finite automata can be easily described by simple expressions called regular expressions. … Read more
What is Regular Set in TOC
In the field of theoretical computer science, particularly in the area of formal languages and automata theory, a regular set refers to a set of … Read more
What is Trap state ?
RGPV PYQ 2010 A trap state, which may also be called non-halting or absorbing state, is a state from which a finite automaton (FA) or … Read more
RGPV short note on automata
RGPV 2010Q. Write short note on automaton? Ans. An automaton is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. There are … Read more