NFA for Alphabets in Matrix Form...

What is the Language described by this NFA?...

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

How to design NPDA for accepting these languages?...

How to construct NPDA corresponding to the below grammar?...

How many languages does a DFA recognize?...

Provide a context-free grammar that generates odd length language {w = 0*1* : |w| is odd}...

Is epsilon and empty set languages of NFA? (Nondeterministic Finite Automata)...

Does order not matter in regular expressions?...

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

Unable to construct 4-state NFA for certain regular expression...

Converting NFA to DFA...

Construct a new DFA B from A where L(B) = L(A) - {w | w∈E* }...

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

NFA to DFA conversion confusion?...

Q: Pumping Lemma Proof...

Is there any other way of lexing JavaScript into token except context free grammar provided in ECMAS...

Union and Intersection can be a part of Regular Expression?...

Nondeterministic finite acceptors basic question...

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

Python is reading one of my classes in as a variable and giving a reference error...

If the string of L consists of 0's only prove that L* is regular...

Regular Expression of Language {a b} which contains string of Odd Length and must contain atleast on...

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

Regex | Containing "bbb"...

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

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