Turing Machine: take a mod of two numbers?...

Applying kleene star to a FSM...

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

If M is a turing machine, the question if L(M) = A Regular Language, Decidable?...

Build grammar to the language...

Deterministic Finite Automata divisibility problem...

Design DFA accepting binary strings divisible by a number 'n'...

Automata to regular expression...

FSM in VHDL is Moore or Mealy?...

Epsilon closure & automata...

Formal Context Free Grammar From Context Free Language...

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

Please help me covert the dfa to regular expression...

Role of automata in Compiler Construction...

Regular Expression: Having All strings except bba and abb...

Prove that the languages are not context free?...

What if all states are accepted in Minimizing Deterministic Finite Automata with Hop-croft Algorithm...

Why is figuring out if the cardinality of a language is not finite a "decidable" problem?...

Do both of these regular expressions...

Can Countable string is Countable always?...

Converting Epsilon-NFA to NFA...

Why Doesn't This NFA Accept Empty String?...

Show that, for any languages L1 and L2, we have (1). L1L1^* = L1^*L1L1^*...

Can any tell me the regular expression for the given language?...

How Can I Tell if a DFA Accepts an Empty String?...

NuSMV getting stuck at a trivial deadlock...

Can a finite automata have more than one input states?...

Efficiently check if path is valid in graph using NetworkX?...

Constructing Finite State Machine...

Deterministic Finite Automata...