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

regular Expression in which Letter b in never Tripled...

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

Can epsilon production be assumed in a left recursive grammar...

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...

C++ code example that makes the compile loop forever...

Can I use stack in Turing Machine?...

Regular Expression to DFA...

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitut...

When to use Ø for states in DFA / NFA...

How to prevent duplications when generating strings from context free grammar...

Can a DFA have epsilon/lambda transitions?...

Recursive vs recursively enumerable language in Turing Machines?...

construct a PDA for the following language...

Build an FA that accepts only the words baa, ab, and abb and no other strings longer or shorter...

DFA creation and minimization...

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

Python implementation for the CYK Algorithm...

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

Is the given language a valid CFG?...

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

Can I write the empty string inbetween characters forming a string?...

How to Pumping lemma for Regular language...

Regular Expression All strings where the number of b’s can be evenly divided by 3...

How to find out the language that accepted by below NPDA...

How many languages does a DFA recognize?...

how to transfer between arrays in c#?...

Whether a context free language is deterministic context free language...

Design a turing machine that accepts the language L= {a^n+1 b^2n c^3n: n>=0}...