Example 1.010 TOC GATE CS 2010 (DFA missing arcs)

GATE CSE 2010Подробнее

GATE CSE 2010Подробнее

GATE CSE 2013Подробнее

GATE CSE 2012Подробнее

Example 1.009 TOC GATE CS 2010 (NFA substring)Подробнее

Example 1.007 TOC GATE CS 2008 (product automaton)Подробнее

Example 1.006 TOC GATE CS 2006 (DFA minimum states)Подробнее

GATE CS 2012,Q46:Consider the set of strings on {0,1} in which, every substring of 3 symbols has atПодробнее

34 Theory Of Computation | Gate 2009 The above DFA accepts the set of all strings over {0,1} thatПодробнее

GATE CS 2010,Q37: The program below uses six temporary variables a, b, c, d, e, f. a = 1 b = 10Подробнее

GATE 2014 SET-1 | TOC | DFA | REGULA EXPRES | GATE TEST SERIES | SOLUTIONS ADDA | EXPLAINED BY VIVEKПодробнее

GO Classes Meetup – GATE CS/DA Offline Seminar (Offline) - Jaipur | Meet Us in Person | GATE CS, DAПодробнее

GATE CS 2011,Q45:A deterministic finite automation (DFA)D with alphabet {a,b} is given belowПодробнее

Example 1.008 TOC GATE CS 2008 (regular set)Подробнее

35 Theory Of Computation | Gate 2011 Definition of a language L with alphabet {a} is given asПодробнее

GATE 1995 Questions in Algorithm For merging two sorted lists of sizes m and n into #GATE #CSПодробнее