Regular language is a language which can be represented by a regular expression and thus every string in the language can be accepted by the corresponding deterministic finite automaton.
I'm studying for my computing languages test, and there's one idea I'm having problems wrapping my head around. I understood …
context-free-grammar regular-language automataIm having a problem in solving the problem:- Its an assignment, i solved it, but it seems to be …
string language-theory regular-languageI need help with constructing a left-linear and right-linear grammar for the languages below? a) (0+1)*00(0+1)* b) 0*(1(0+1))* c) (((01+10)*11)*00)* For a) I …
grammar regular-language computation-theory formal-languagesMy problem may sounds different to you. I am a beginner and I am learning Finite Automata. I am googing …
regular-language finite-automata computation-theory dfaI'm trying to understand the concept of languages levels (regular, context free, context sensitive, etc.). I can look this up …
syntax programming-languages bnf regular-language formal-languagesIn a CS course I'm taking there is an example of a language that is not regular: {a^nb^n | …
computer-science fsm regular-languageI have troubles in solving/proving this problem. Any ideas please?
regular-language dfa formal-languagesThe regular definition for recognizing identifiers in C programming language is given by letter -> a|b|...z|A|…
regex computer-science regular-languageI am asked to show DFA diagram and RegEx for the complement of the RegEx (00 + 1)*. In the previous problem I …
regex regular-language automata dfa nfaWrite an expression that contains an even number of 0s or an odd number of 1s I got it down …
regex regular-language finite-automata