computer-scienceautomataformal-languages
generating grammars from a language (formal languages and automata theory)
guys I've been working on this assignment for my formal languages class for a couple of days now, and I'm stuck when it comes to generating grammars for a given language. I don't have an example in my textbook similar to this question to follow, so I was hoping anyone could provide an explanation. thank you. 
Solution
To solve the problem:
- Understand which words are in L.
I actually did this part for you: L defines that any words in that language start with any number (including 0) of a or b, followed by 1 or more as, follwoed by one b, maybe followed by any number of as, followed by the same character it started with (or a repetition of them).
- Read one grammar. See if you can construct words with this grammar that are not in L.
- See if you can find words in L that can not be constructed by this grammar
- If you find either, proceed with the next grammar
- if you find none, the grammar successfully generates L.
- Sort shopping list based on previous shopping trips
- What is a plain English explanation of "Big O" notation?
- How to speed up Sieve of Eratosthenes python list generator
- How do I generate sentences from a formal grammar?
- What algorithms do popular C++ compilers use for std::sort and std::stable_sort?
- What does asynchronous I/O issue after the completion of I/O
- HTML5 Canvas background image
- In Computer Science, what's the opposite of a dependency?
- How to determine the longest increasing subsequence using dynamic programming?
- Binary Safety redis
- What are vectors and how are they used in programming?
- Visual Studio Code cannot open source file "iostream"
- What are the differences between NP, NP-Complete and NP-Hard?
- Why is mov turing complete?
- Convert recursion to iteration
- What is the most efficient pattern/algorithm to compare two lists and find the delta between those two lists?
- On the shader code, why we can't read variables allocated in process memory(e.g. RAM)?
- Why is large integer division faster than slicing (numeric) strings, for accessing individual digits?
- Why co-NP is not a subset of NP?
- DFA for input starting with "1", and having "11" in it. Why it doesn't accept this input?
- What is 'mini-batch' in deep learning?
- Negative speed up in Amdahl's law?
- Clarification on "each digit represents an increasing power of 10" in number representation
- What is referential transparency?
- Two's complement: why the name "two"?
- What's the difference between an environment and a frame in computer science?
- Difference between zero crossing and threshold
- Time complexity analysis of data structures
- Does anybody know from where the "layer of abstraction"/"layer of indirection" quote emerged?
- CS50 PSet 7 Movies (9.sql )