regular expression for L = {w ∈ {a, b}*, Na(w) mod 2 = 1}...

construct a pushdown automata for L={a^mb^n where n<=m<=2n}?...

DFA with 4 or 5 states...

How to make this CFG conflict free?...

DFA creation and minimization...

confusion in finding first and follow in left recursive grammar...

Unable to fugure out the Regular Expression of the following...

Find a linear bounded automaton that accepts the language L = { a^{n!} : n >= 0 }...

What is the difference between a Turing Machine and an Algorithm?...

Turing machine designing from equation...

Finding a grammar or a pushdown automaton that recognizes { a^i b^j b^i a^j | i,j >= 0 }...

How to understand ATN graph generated for ANTLR grammar?...

Check if 2 minimum DFA are equivalent...

generating grammars from a language (formal languages and automata theory)...

flower automaton for L = {aa, bb, ba, baa, bba}...

Trying to draw a Non- Deterministic Finite Automata...

How to construct a pushdown automata for L={a^nb^m where n<=m<=2n}?...

Can the unreachable state removed in this minimized DFA?...

How do I get the context free grammar of this language?...

How many equivalence classes in the RL relation for {w in {a, b}* | (#a(w) mod m) = ((#b(w)+1) mod m...

Pumping lemma (Regular language)...

Making NFA of Regex ^[a-zA-Z0-9]{3,16}$...

How do you draw a DFA for a specific range of binary numbers?...

How many initial states can an NFA and DFA have?...

Chomsky hierarchy - examples with real languages...

Trying to Build DFA...

Resolving shift/reduce conflicts in ply yacc...

How L = {a^n b^m | n,m>=1, n != 3m} is not regular?...

NFA to accept the following language...

How to Pumping lemma for Regular language...