Example 1:Construct a DFA, that accepts set of all strings over ∑={a,b} of length  2  i.e. |w|= 2 Example  2 :Construct a DFA, that accepts set of all strings over ∑={a,b} of length at least  2  i.e. |w|>= 2 Example  3 : Construct a DFA, that accepts set of all strings over ∑={a,b} of length at most  2  i.e. |w|<= 2 Example  4 : Construct a DFA, that accepts  string 'ab' over ∑={a,b}   Example  5 : Construct a DFA,accepting all strings ending with 'ab' over ∑={a,b}   Example  6 : Design DFA which checks whether a given binary number is divisible by  3 Example  7 : Design DFA to accepts L , where L  is set of strings in which 'a' always appears trippled over ∑={a,b} Example  8 : Construct minimal DFA over ∑={a,b} which checks whether given                       a) Binary number is even                       b) Binary number is odd Example  9 : Construct minimal DFA which accepts set of all strings over ∑={a,b}  in which every ‘a’ should n

👉What is an Abstract: Ø   The 250-300 word abstract will highlight the important features of the thesis/dissertation/ project report .Generally it is termed as Executive Summary in technical reports. Ø   An abstract will be considered as a movie trailer. People will only read the rest of the manuscript if they find your abstract attractive and interesting. Ø   Always write the abstract after you have cultivated writing your whole paper. Ø   Select and pick up key statements from your introduction, methods, results, and discussion sections to shape your abstract with a logical flow. Ø   Edit your abstract carefully to make it exhibiting and meet the word count requirements of the journal. Ø   An abstract must include Key words and phrases that quickly identify the content and focus of the work. 👉Types of abstract: ·         Critical abstract  –Here, the researcher evaluates some paper and compares it to other works and papers on the same topic ·         De

     👉    INTRODUCTION: The title of Chapter 1 will be Introduction. A good technical report/thesis Introduction does four things:     a)  It highlight the problem and motivation for the study. ·       Tell the proof-reader what the topic of the report is. ·       Explain why this topic is crucial.     b) It introduces a brief summary of previous engineering and/or scientific and experimental work on the topic. ·      Here you present an overview what is experienced about the problem. You would typically cite earlier studies conducted on the same topic and/or at this same site, and in doing so. ·      If you are writing a thesis, you need a full-blown research/literature review with very specific details of all of the scientific or engineering work done on the topic to date. In the introduction, just present a brief summary/analysis, sufficient to establish the need for your research.     c) It sketch/outline the purpose and specific objectives of the project.

A Complete guide for Weekly Project Report Most projects need regular reporting, depending on the size and importance of the project. Monthly reports are sometimes enough to cover up a project, but considering the primary purpose of reporting is to keep the project team, the management, and other stakeholders cognizant / informed about the project, weekly reporting is the best way to go. Since nobody wants astonishment, especially regarding actual project implementation, it is essential to produce weekly project reports. It also gives an excellent opportunity to focus/address any concern of the management and the stakeholders related to the project. Most likely, the management and the stakeholders are likely to know whether the project manager know about any future problems that may arise. They would also want to know where the project is in the  momentum, including a predict of the costs and time of project completion.  Weekly status report is a summary of all work perfor

Steps or Procedure of converting NFA to DFA: 1)       Construct state diagram of NFA 2)       Draw transition table of NFA diagram. 3)       Draw transition table of DFA from NFA transition table. 4)       Construct DFA state diagram. Note: Every dead configuration in NFA i.e. ∅ must be translated into dead state(trap state) in DFA Example- 01 : Convert the given NFA which accepts the language L={ Strings starts with ‘a’ } Over ∑={a,b} SOLUTION: Step-1: Transition diagram of NFA Step-2:Transition table of NFA: Present State Next State Input a Input b à q 0 {q 1 } ∅      *q 1 { q 1 } {q 1 }     Step-3:Transition table of DFA: Present State Next State Input a Input b à q 0 [q 1 ] D      *q 1 [q 1 ] [q 1 ] D D D Step-4:Transition diagram of DFA:

1. Finite state machine is ___________tuple machine. a) 4 b) 5 c) 6 d) unlimited View Answer: 5 2. Transition function of DFA machine maps. a) Σ x Q -> Σ b) Q x Q -> Σ c) Σ x Σ -> Q d) Q x Σ -> Q View Answer: Q  x  Σ -> Q 3. Number of states require to accept string ends with 101. a) 3 b) 4 c) 2 d) can’t be represented. View Answer: 4 4. Language of finite automata is generated by a) Type 0 grammar b) Type 1 grammar c) Type 2 grammar d) Type 3 grammar View Answer: Type 3 grammar 5. Finite automata needs minimum _______ number of stacks. a) 0 b) 1 c) 2 d) None of the mentioned View Answer: 0 6. Φ in minimal finite automata need _____________ no. of final states a) 1 b) 2 c) 3 d) None of the mentioned View Answer: None of the mentioned 7. Regular expression for all strings starts with ab and ends with ba is. a) aba*b*ba b) ab(ab)*ba c) ab (a+b)*ba d) All of the mentioned View