# Tagged Questions

22 views

### Chomsky form for language of single alphabet member

I'm a bit confused as to how to represent the Chomsky form for the language L that generates all strings with the alphabet {a} My approach was ...
54 views

### Constructing right-linear grammar

Is the grammar $\qquad S \to 1A0A \mid 0A \mid \varepsilon$ a right-linear grammar? $A$ is a nonterminal here, $0$ and $1$ are terminals. I know $0A$ is right-linear but what about $1A0A$? Trying ...
178 views

### How to convert a context free grammar (could generate regular language) to a right-linear grammar

Consider the context free grammar: $$S \rightarrow aSb \mid aSa \mid bSa \mid bSb \mid \varepsilon$$ It could generate regular language, which means it can be converted to a right linear grammar. Is ...
I went through a question asking me to categorize the following grammar. $$S → AA, S → AB, A → a, A→BB, B → b, B → e$$ From the production rules, clearly it is Context-Free. But it accepts a finite ...