I have understood that L={wxw^r|w,x belongs to {a,b}^* } is regular because it turns out to be the pattern of starting and ending with same symbol but I am not getting the proper explanation that how to say L={ww^rx|w,x belongs to {a,b}*} is regular language using DFA design. Please help me in understanding this!
How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?
683 Views Asked by Shivam Chauhan At
1
There are 1 best solutions below
Related Questions in REGULAR-LANGUAGE
- Regular expression for strings that cointains a and an even number of b's
- How to exclude part of alternative from capture?
- How can I extract two specific numbers from multiple line of a text file in python
- Regular Expression to retrieve length
- Simple regular expression(Pattern) for a decimal with a precision of 2
- RegExp result is not my expected
- Converting DFA to RE
- Regular expression to evaluate following string
- Is it possible to make a regular grammar enforcing usage of a given character?
- If pref(L) is regular, does that imply L is also regular?
- Determining if two languages are equal [Regular expression]
- Shortest regex for binary number with even number of 0s or odd number of 1s
- how to intuitively think while Designing an NFA
- Check if a regex is ambiguous
- finding good hash function for languages accepted by finite state automata
Related Questions in COMPUTATION-THEORY
- Grammar for a^n
- Is there an algorithm for a compiler compiler that generates a recursive descent parser?
- Is $E_{LBA}$ a Turing recognizable language?
- The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable
- Knuth's bit reversal explanation
- How do I determine the big O for my nested for loop?
- Nullable nonterminals
- YACC: finding shift/reduce conflicts in a grammar
- Can this function be simplified (made more "fast")?
- how to intuitively think while Designing an NFA
- Assisstance with comparisons in primitive recursion
- Speeding up division and remainder when numerator is a multiple of power of two
- Is this a common pattern faced in Computer Science?
- Can abstract models for solving NP-hard problems be built in reality?
- How is Turing Machine which accepts nothing is not Recursively Enumerable?
Related Questions in FINITE-AUTOMATA
- i want dfa that accept string of{a,b,c} that starting with a and ending with c and have even no. of b
- Converting DFA to RE
- Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'
- Does there exist a TM for all countable languages?
- How to find useless states in a finite state machine Prolog
- Can a RegEx with negative lookahead be represented as a finite automaton?
- Can final and non-final states having identical configurations be merged together in a minimal DFA?
- automata theorem: existance of a DFA
- Shortest regex for binary number with even number of 0s or odd number of 1s
- Coding a propositional logic parser by hand
- Modeling FSM with conditions?
- Finding DFA of r* when r and DFA of r were deifined
- How to Design an acceptor for integers in a programming language C
- Minimum number of states needed?
- What is the fastest way to compute an epsilon closure?
Related Questions in AUTOMATA-THEORY
- Grammar for a^n
- Can final and non-final states having identical configurations be merged together in a minimal DFA?
- Finding DFA of r* when r and DFA of r were deifined
- How to call a structured language that cannot loop or a functional language that cannot return
- What regular language intersects with 1*0* gives 1n0n
- Context free grammar for this language
- What type of languages are accepted by a PDA in which stack size is limited?
- Finiteness of Regular Language
- Notation for concat in set theory
- Python implementation for the CYK Algorithm
- CFG for a = b and c = d (length)
- In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?
- When to use Ø for states in DFA / NFA
- Design a turing machine to accept {1^n : n is prime number}
- How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?
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)
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?
This is a trick question. The language L as you have specified is the language of the regular expression
(a + b)*, that is, any string of a's and b's. The trick is that for any stringy = s1.s2.s3...skwheresi in {a, b}, we can writey = wxw^Rwherewis the empty string andx = y. Basically, the trick is that we can always choosewto be the empty string, and in that case we are left withL = {x | x in {a, b}^*}, clearly regular. Another way of thinking about it is this: can you find any string of a's and b's that is not in L? Is it not in L even if you take w to be the empty string?