DFA over language {0,1}...

What will be the DFA for the regular expression 0(0+1)*0+1(0+1)*1?...

How do you construct the union of two DFAs?...

Regular Expression for Binary Numbers Divisible by 3...

Steps to draw a DFA (or NFA) from a simple statement?...

Are my DFA's correct? (arbitrary long sequence of 0's and 1's)...

DFA for all binary strings having even number of 0's or contains exactly two 1's...

Create a DFA that contains "11" or ends with "10"...

Theory of computer science problems...

a challenging finite automata - what is the language?...

State diagram of DFA with 5 states...

Am I correct? (Finite Automata)...

What strings are accepted by the pattern "^[ab]?|c?$"?...

Conversion of NFA having a missing transition for any input character on initial state to DFA...

Automata theory: Formal definition of indistinguishable & distinguishable strings and example co...

Regular Expression for Automata for Strings that do not end in 01...

DFA- Set of all strings whose 10th symbol from the right end is 1...

NFA or DFA accepting # of positions of 4k between 0's...

Minimum number of states in a DFA having '1' as the 5th symbol from right...

Why do we use pumping lemma to prove the non-regularity of languages? WHY?...

can a DFA have an arrow with empty string as input?...

Why L={wxw^R| w, x belongs to {a,b}^+ } is a regular language...

Parser vs. lexer and XML...

Can all context free grammars be converted to NFA/DFA?...

Design DFA accepting decimal strings divisible by 7...

Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?...

Are those two regular languages the same?...

NFA to DFA conversion = deterministic?...

Regular Expression to DFA...

DFA that will accepts the string having odd number of 1's and odd number of 0's...