I have to do L1 U L2 and intersection L1 n L2
1
There are 1 answers
Related Questions in AUTOMATA
- Converting ENFA To DFA and ENFA NFA
- Need clarification on pumping lemma for context free languages
- Unable to create an DPDA that accepts strings in binary notation multiples of 3
- how to model and verify model
- UPPAAL chooses to loop on instead of a transition of a higher priority
- Build a Turing Machine that counts a's and b's
- Convert the given Moore Machine into Mealy machine
- Converting context free grammar to chomsky normal form
- Intersection of two Deterministic Finite Automata (DFA)
- NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s
- Finding a regular grammar for the language L
- Does this DFA satisfy the complement of the given language?
- How to Perform Bottom-Up Parsing for a Given CFG and Input String?
- Regular expressions matching given string
- If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is?
Related Questions in DFA
- Theory of Comp Sci - State Diagrams NFAs
- Converting ENFA To DFA and ENFA NFA
- Theory of computer science problems
- a challenging finite automata - what is the language?
- Correct labeling for this regular language?
- State diagram of DFA with 5 states
- How to get automatically token for dfa every 7 days
- Finite state automata minimization
- DFA for all binary strings having even number of 0's or contains exactly two 1's
- Need a DFA for the alphabets {a,b} such that the language must contain equal and even numbers of a and b
- Intersection of two Deterministic Finite Automata (DFA)
- Assembly Code Segmentation Error While Making DFA state machine
- Deterministic finite-state automaton in x86 Assembly (GCC)
- Construct DFA that accept binary string having odd number of 1’s or even number of 0’s
- What strings are accepted by the pattern "^[ab]?|c?$"?
Related Questions in NFA
- Theory of Comp Sci - State Diagrams NFAs
- Converting ENFA To DFA and ENFA NFA
- Theory of computer science problems
- State diagram of DFA with 5 states
- Conversion of NFA having a missing transition for any input character on initial state to DFA
- Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
- Create a NFA from BNF grammar
- Bitap algorithm for Fuzzy search example
- DFA- Set of all strings whose 10th symbol from the right end is 1
- NFA or DFA accepting # of positions of 4k between 0's
- unable to display tables and diagrams in python for non deterministic finite automata
- By writing a regular expression or a grammar, describe the language accepted by the NFA
- Why is the most constraint language for this not Regular and instead, Context-Free?
- Why the conversion of an NFA to DFA is useful?
- Regular Expression | Automata Theory
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
You can run through the formal Cartesian product machine construction to algorithmically derive automata for the intersection and union of L1 and L2. However, since these languages are so easy, it might be simpler to give the languages and just write down a DFA for each one.
L1 is the language of all strings of as and bs with at least one a. L2 is the language of all strings of as and bs with at least two bs.
To accept the intersection of L1 and L2, we need to see at least one as and two bs. Below, we have six states:
q5, where we still need one a
--->q0-a->q1-b->q2-b->q3 -b->q4-a->q2 q3 -b->q5-a->q3
(where transitions are missing, they are self loops)
Note that there are six states: this is the same as if we had done the Cartesian product machine construction on the original DFAs of two and three states, respectively.
For union, we can use the exact same DFA and change the set of accepting states to q1, q3, q5. This captures the fact that we now accept when either condition is true (and states q1 and q5 are where one, but not both (as in q3) conditions become satisfied).