Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | CFG Exercise: a^mb^ia^n, i=m+n | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ia^n, i=m+n. | OpenDSA | Context-Free Grammar |
| 2 | CFG Exercise: a^mb^ic^n, i less than 3 | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ic^n, i < 3. | OpenDSA | Context-Free Grammar |
| 3 | CFG Exercise: Odd length | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^nb^m where m - n is positive, odd. | OpenDSA | Context-Free Grammar |
| 4 | CFG Exercise: a's and b's are equal | Grammar Construction Exercise | User creates a CFG that generates strings in the language where the number of a's and b's is equal. | OpenDSA | Context-Free Grammar |
| 5 | CFG Transformation Exercise 1 | Grammar Construction Exercise | User creates an equivalent CFG with no usless, lambda, or unit productions: Exercise 1. | OpenDSA | Context-Free Grammar |
| 6 | CFG Transformation Exercise 2 | Grammar Construction Exercise | User creates an equivalent CFG with no usless, lambda, or unit productions: Exercise 2. | OpenDSA | Context-Free Grammar |
| 7 | CFG Transformation: Chomsky Normal Form | Grammar Construction Exercise | User creates an equivalent CFG in Chomsky Normal Form. | OpenDSA | Context-Free Grammar |
| 8 | Grammar Construction Exercise: Three Strings | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has three strings. | OpenDSA | Language, Grammar |
| 9 | Grammar Construction Exercise: abb | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has some a's followed by twice as... | OpenDSA | Language, Grammar |
| 10 | Grammar Construction Exercise: a's and b's | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has some a's followed by some b's. | OpenDSA | Language, Grammar |
| 11 | Grammar Construction Exercise: Palendrome | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language is palendromes on a's and b's. | OpenDSA | Language, Grammar |
| 12 | Grammar Construction Exercise: Balanced Parentheses | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has balanced and properly nested parentheses. | OpenDSA | Language, Grammar |
| 13 | Regular Grammar Exercise: aaab*ba | Grammar Construction Exercise | User writes an regular grammar for the language of strings matching the regular expression (aaab*ba)*. | OpenDSA | Regular Expression, Regular Grammar |
| 14 | Regular Grammar Exercise: a's a Multiple of 3 | Grammar Construction Exercise | User writes an regular grammar for the language of strings with the number of a's being divisible by 3. | OpenDSA | Regular Grammar |
| 15 | Regular Grammar Exercise: Number of a's and b's is Odd | Grammar Construction Exercise | User writes an regular grammar for the language of strings with an odd length. | OpenDSA | Regular Expression, Regular Grammar |
| 16 | Regular Grammar Exercise: bb*aaa* | Grammar Construction Exercise | User writes an regular grammar for the language of strings that meet this regular expression: bb*aaa* | OpenDSA | Regular Expression, Regular Grammar |
| 17 | Regular Grammar Exercise: NFA Conversion 2 | Grammar Construction Exercise | User writes a regular grammar equivalent to a given NFA: Exercise 2. | OpenDSA | Non-Deterministic Finite Automata, Regular Grammar |
| 18 | Regular Grammar Exercise: NFA Conversion to Right Regular Grammar | Grammar Construction Exercise | User writes a right regular grammar equivalent to a given NFA: Exercise 2. | OpenDSA | Non-Deterministic Finite Automata, Regular Grammar |