Though this expression, is accepted by deterministic finite automation, but if we applying pumping lemma on this expression, pumping lemma fails, also this expression have finite states but does not halt and run on continuously, the edges keep making self loops b/w the states as i tends to become larger and when tends to infinity, it does not supposed to be halt. So, for this expression DFA can be drawn but pumping lemma and TM fails. So, tell is this a regular grammar or not?
Is a^i^2 | i>=1 regular?
328 Views Asked by peeyush.cray At
1
There are 1 best solutions below
Related Questions in REGEX
- Python and regex, can't understand why some words are left out of the match
- Special access rule in an .htaccess file for IP addresses, authorized only for one directory structure
- regex working not as expected javascript, displays wrong values
- Clarity on how can `.*` match all strings?
- IIS Rewrite Module exclude bots but allow GoogleBot
- Regex skipping delimiter is there is / before it
- How to ignore case in regexp mapping in a .htaccess rewrite rule?
- Select all lines after last occurrence of a certain character
- Segregate class names using regular expresions
- Regex to match binary literal number in re2c format
- why the perl regular expression is not identifying the value
- Trying to run subprocess commands with carriage returns and newlinees
- `Backward slash + b` does not work as expected on regex
- Extract 15 words before and 8 words after each 9digit number from a text file using regular expressions in python
- How to migrate this regex to JavaScript
Related Questions in AUTOMATION
- Applescript To Select Sound Output stops at opening Sound Preferences Screen
- I am automating web scraping using python
- Autofill data from previous cell to next cell in openpyxl
- In spotfire, IronPython script: No Module named Selenium
- Python selenium automation browser
- Specflow defination not showing references
- Expect: Any way to match a specific rule only once?
- Automate the update of a pivot table in Excel via Power Automate Web
- Encountering a problem to interact with a weird button which is a combobox (select)
- Unable to Login through Automation(Cypress) to app, while the credentails are true. It allows manual login but unable to login through Cypress
- Selecting an option in the mobile app drop down which is not visible when the app is loaded for the first time
- Unable to launch WebDriverAgent
- How do I automate a video download with Selenium and Python (Meta Quest Store Trailer Download)
- Error: Could not start a new session. Possible causes are invalid address of the remote server or browser start-up failure
- Trouble uploading with playwright
Related Questions in PUMPING-LEMMA
- Why pumping lemma for context free languages do not have bound on first part of string?
- Recognize the type of the given formal language
- concatenation of a context-free language
- Pumping Lemma and Hierachy
- Using string of set length with pumping lemma to prove irregularity
- Can someone help me with this proof about the pumping lemma using coq?
- Why is L = {a^ib^i , 0<i<5} regular?
- Is L = {a^n a^n b^m |m, n ≥ 0} a regular or irregular language?
- Proving if a language is context free with pumping lemma
- Is L = {ww^Ru | w, u ∈ {0,1}+} regular language?
- Regular language demonstration
- How to prove a language with (ab)^n.. is not regular with pumping lemma?
- How to translate this description into a language?
- How to prove that L = {a^j b^k c^k d^k: j, k ≥ 1} ∪ {b^j c^k d^l : j, k, l ≥ 0} satisfies the pumping lemma for CFL’s?
- Operating on a Regular Expression before applying Pumping Lemma
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 # Hahtags
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?
Actually a DFA cannot be drawn (at least a correct one that is). You're right that the pumping lemma gives a contradiction, it's easy to pump i up or down to make it non-square. If the pumping lemma shows that a language is not regular, then by definition there is no way to draw a DFA to represent that language.
The set of states is infinite, there must be one state to accept a^1, one for a^2, one for a^3 and so on. Then there's all the states between these accepting ones.. it gets messy pretty quickly. Anyways, if the pumping lemma shows a language is not regular (assuming you're applying it properly), then there is no DFA (or regular expression) to represent the language.