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 answers
Related Questions in REGULAR-LANGUAGE
- Correct labeling for this regular language?
- How to use JavaScript's sql-formatter library to parse a SQL statement that contains the nested concat function in the where condition
- What regular expression will match a string of letter "U"s and letter "O"s where at most one pair of (U, O) or (O, U) appear next to each-other?
- How can I generate a Context Free Grammar for a specific language
- how to prove {(a^m)(b^n)(c^k): m!=k and m,n,k ∈ N} is non-regular?
- Jenkins - To trigger pipeline only for event failed or successful for jenkins webhook trigger
- How to write a generical REGEX expression to: Σ = {a, b, c}, L = {w ∈ Σ ∗ / the first symbol of w is equal to the last symbol of w}?
- How can I allow a single space in a regex in Dart but allow other characters to be 1 or more?
- How remove numbers from url using RewriteRule in .htaccess file?
- Regular expressions matching given string
- How do the kleene plus operators apply here?
- Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
- Accept an optional substring with Lark's LALR(1) parser
- Match bitwise operators in lex
- concatenation of a context-free language
Related Questions in COMPUTATION-THEORY
- Understanding Unary PCP Reduction to a Matching Problem (UPCP)
- Balanced parentheses and brackets, where a closing bracket also closes any outstanding open parentheses (up to the previous open bracket)
- a challenging finite automata - what is the language?
- Optimization - Algorithm for finding load set combination that returns the maximum Von Mises stress
- Unable to create an DPDA that accepts strings in binary notation multiples of 3
- how to find the grammar of this Language?
- Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0
- Complexity/decidability of the "nested maze" problem?
- Maximum sum, min length subset
- 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
- What is a functional model, sequential model, and concurrent model?
- How to I constract a grammar that generates this language ? (Grammar of type 0)
- What is the flaw in the proof of the countability of the set of finite language?
- Does this DFA satisfy the complement of the given language?
Related Questions in FINITE-AUTOMATA
- a challenging finite automata - what is the language?
- Correct labeling for this regular language?
- Unable to create an DPDA that accepts strings in binary notation multiples of 3
- Need a DFA for the alphabets {a,b} such that the language must contain equal and even numbers of a and b
- Convert the given Moore Machine into Mealy machine
- What is the flaw in the proof of the countability of the set of finite language?
- NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s
- Conversion of NFA having a missing transition for any input character on initial state to DFA
- On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition
- Convert Nondeterministic Finite Automata to Regular Expression
- How do I make a string validator for Deterministic Finite Automata?
- Can Arden's theorem provide multiple regular expressions for a given DFA if the order and process of solving the equations are changed?
- Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
- NFA or DFA accepting # of positions of 4k between 0's
- Using bracket for automata
Related Questions in AUTOMATA-THEORY
- how to model and verify model
- Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0
- NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s
- Is there a parsing algorithm for languages generated by context-sensitive grammars?
- If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is?
- Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
- Can epsilon production be assumed in a left recursive grammar
- Prove that the following problem is undecidable by a reduction from the halting problem:
- what is the Context-Free Grammar for the following language?
- DFA- Set of all strings whose 10th symbol from the right end is 1
- Can we transfer every DFA to DFAs with start state having no in edge?
- NFA or DFA accepting # of positions of 4k between 0's
- Regular expression for odd length of a's and odd length of b's
- Using bracket for automata
- unable to display tables and diagrams in python for non deterministic finite automata
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)
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?