Newbetuts
.
New posts in computation-theory
Construct grammar given the following language {a^n b^m | n,m = 0,1,2,...,n <= 2m} [closed]
grammar
context-free-grammar
computation-theory
context-sensitive-grammar
Pumping lemma for regular language
regular-language
dfa
computation-theory
pumping-lemma
Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s
regular-language
finite-automata
computation-theory
dfa
Is a*b* regular?
regular-language
computation-theory
Left-Linear and Right-Linear Grammars
grammar
regular-language
computation-theory
formal-languages
Prev