RGPV TOC design finite automata problems
RGPV 2008Prob 01: Designa FA which accepts set of strings containing four 1’s in every string over alphabet ∑ = {0, 1}. Ans. Some example strings ...
Read moreRGPV 2008Prob 01: Designa FA which accepts set of strings containing four 1’s in every string over alphabet ∑ = {0, 1}. Ans. Some example strings ...
Read moreRGPV 2010Q. Formally define the following (with example)- Mealy machine Moore machine 1. Mealy machine: Mealy machine is a six tuple machine. M = (Q, ...
Read moreRGPV 2010, 02Q. Write short note on equivalent of DFA and NDFA ? Ans. Every DFA is an NDFA. If from a regular set an ...
Read moreRGPV 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 moreRGPV 2019Q. Explain the concepts of generalization and aggregation with appropriate examples ? Ans. Generalization: It is a bottom-up approach in which two lower level ...
Read moreRGPV 2019Q. Differentiate between Database approach vs Traditional file accessing approach ? Ans. Database approach Traditional file accessing approach All Application shares a pool of ...
Read moreRGPV 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 moreDia Software: Q1. From where I can donwload Dia software ? Ans. From this link Download link. Or you can do Google too. Q2. What is ...
Read moreRGPV 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 moreIn 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