DFA for all binary strings having even number of 0's or contains exactly two 1's...
Read MoreCreate a DFA that contains "11" or ends with "10"...
Read MoreTheory of computer science problems...
Read Morea challenging finite automata - what is the language?...
Read MoreState diagram of DFA with 5 states...
Read MoreWhat strings are accepted by the pattern "^[ab]?|c?$"?...
Read MoreConversion of NFA having a missing transition for any input character on initial state to DFA...
Read MoreAutomata theory: Formal definition of indistinguishable & distinguishable strings and example co...
Read MoreRegular Expression for Automata for Strings that do not end in 01...
Read MoreDFA- Set of all strings whose 10th symbol from the right end is 1...
Read MoreNFA or DFA accepting # of positions of 4k between 0's...
Read MoreMinimum number of states in a DFA having '1' as the 5th symbol from right...
Read MoreWhy do we use pumping lemma to prove the non-regularity of languages? WHY?...
Read Morecan a DFA have an arrow with empty string as input?...
Read MoreWhy L={wxw^R| w, x belongs to {a,b}^+ } is a regular language...
Read MoreCan all context free grammars be converted to NFA/DFA?...
Read MoreDesign DFA accepting decimal strings divisible by 7...
Read MoreIs L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?...
Read MoreAre those two regular languages the same?...
Read MoreSteps to draw a DFA (or NFA) from a simple statement?...
Read MoreNFA to DFA conversion = deterministic?...
Read MoreDFA that will accepts the string having odd number of 1's and odd number of 0's...
Read MoreHow to find longest accepted word by automata?...
Read MoreHow to apply Kleene star on automata?...
Read MoreWhen minimizing DFAs through table fill, should a pair of final states transition to a final/undeter...
Read MoreHow to find the intersection of two NFA...
Read MoreHow can you identify whether the language is regular or context-free language...
Read More