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

Q: Pumping Lemma Proof...

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

Context Free Grammar Design...

Regular expression over the language C={a,b}...

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

Automata to regular expression...

I want regular expression (theory of automata)...

Inverse homomorphism of (00+1)*...

Construct nfa occuring strings over {0,1} such that some two 0's are seperated by a string of le...

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

1^3^n for n>=1 turing machine...

Implementation of a NFA for moves on a 3X3 chess board...

How to generate syntax tree for a particular sentence like a+b*c where id->a|b|c?...

Regular expression in Automata Theory?...

How to create a pushdown automata which accepts a language?...

Linear Temporal Logic Questions (2)...

Give context-free grammars that generate the following language...

What is the relationship between derivation and derivation trees?...

Is this grammar context free or not?...

PushDown Automaton (PDA) for L={a^(n)b^(n)c^(n)|n>=1}...

FA for a language which forms an AGP...

Is OpenGL a "state machine"?...

Finiteness of Regular Language...

number of dfa's that can be designed...

How to construct a grammar that generates language L?...

Construct Context free Grammar...

Define strings and draw language...

Some NFA & REGULAR LANGUAGE & Equivalences...

What sort of automaton does SCXML describe?...