Is this grammar context free or not?...

DFA that accepts strings over {b} of length 2i+5k for any non-negative values of i and k...

Is it possible for a DFA to change its state to a new state without accepting any input symbol...

npda for the language number a's less than or equal to 3 times the number of b's...

Regular Expression in Finite Automata...

Find the DFA for the language L given...

Strings that {b U a}* Accepts (Kleene Star)...

Regular language closure under insertion...

Pumping Lemma Assistance...

automata accepting only ba^(n) for n>=1, odd n using 2 states...

Regular vs Context Free Grammars...

Can a Finite Automata exist without any final state?...

OCaml: Combination of elements in Lists, functional reasoning...

FA for a language which forms an AGP...

Automata: CFG for following language...

Is there any CFG available (with pos tags -part of speech tags) to validate the grammar of sentences...

Levenshtein DFA in .NET...

Push Down Automata...

automata, check string is accepted by language | C++...

Constructing a Regular Expression from a Finite Automata...

Finiteness of Regular Language...

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

show that emptiness and finiteness are unsolvable for linear bounded automata...

We used floating point numbers instead of real numbers in NICE programming language. Why?...

Type Variables in type classes...

Constructing Language generated by the grammar...

Construct a grammar that generates L = {a^p b^m c^n|n>=0, m>=0, p=m+n}...

Is it possible to design an automaton that accepts irrational number?...

DFA - design a DFA that accepts all strings over {0,1} that contains at most two 00's and three ...

Theory of Automata : Context Free Grammar...