How many languages does a DFA recognize?...

Implementing finite-state machine: run-time error, why?...

how do we prove that this language is irregular using the pumping lemma?...

Is (0*1*)* equal to (0 | 1)*?...

If a DFA is minimized, is it guaranteed that it's complement is also minimized?...

concatenation & union - regular and context free languages...

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

Intrusion detection using pattern matching algorithm...

DFA to RE (Introduction to Automata Theory, Languages and Computation)...

Nondeterministic finite acceptors basic question...

Is my description of the language accepted by this DFA?...

String length after kleen's closure in finite-autometa theory...

How to understand DFA (Finite Automata)?...

Prolog List Represented Graph Traversal...

Nondeterministic State Machine understanding...

Is it TRUE that L^R = L, if and only if L is the language of palindromes?...

Are there any programs to draw and test state machines, turing machines, etc?...

Automata to regular expression...

Pumping lemma is used to show a language is non-regular /non-CFL....

Regular Expression Simplification Issue...

Language of all strings that has exactly 1 triple b...

DFA for (0001)*, is it correct...

Regular Languages and Concatenation...

DFA for a set {1,2,4,8,..,2^n} written in binary...

Designing DFA to accept language of even length beginning with 11...

Role of automata in Compiler Construction...

Prove the language is not context-free?...

Is this correct NFA graph?...

Converting an FSA to a regular expression...

How does a LR(1) parser handles empty rules?...