What would be the highest number of states a DFA would have for a language L*? Is it possible to define a worst-case scenario here?
A DFA for Kleene star operation
847 Views Asked by Veronica At
1
There are 1 best solutions below
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 AUTOMATON
- Build a Turing Machine that counts a's and b's
- recognizing a date in the form: 03/02 for February 3 , For simplicity, we consider that each month is made up of 30 days
- Deterministic automaton whose input length is divisible by 3 or 5?
- How is it practically possible to compute an automaton inside a function and then return it?
- Page is timed out now and then on loading
- How to simplify/generalize a Finite State Machine (FSM) for a vending machine?
- A NFA accepting ;anguages whose final digit didn't appear before
- CSS "escape" syntax diagram confusion
- Non deterministic state machine using PyTransitions?
- Push Down Automata Using Fixed States
- how would I build a generalized DFA for decimal Multiples of k?
- can a DFA have an arrow with empty string as input?
- A DFA for Kleene star operation
- Finding a grammar or a pushdown automaton that recognizes { a^i b^j b^i a^j | i,j >= 0 }
- Stack around the variable 'userStr' was corrupted (C)
Related Questions in KLEENE-STAR
- Shunting yard algorithm for parsing basic regular expressions with the Kleene star
- How do the kleene plus operators apply here?
- How to apply Kleene star on automata?
- Order in Kleene star operation?
- Using PCRE2 regex with repeating groups to find email addresses
- A DFA for Kleene star operation
- Regex allow asterisk(*) only once time and in the end
- Implementing Kleene star operator * (sort of) in C program
- How to use a kleene star operator (*) or it's variant (+) with variables in sparql?
- Kleene star semantics and set comparison
- String length after kleen's closure in finite-autometa theory
- Does the kleene-star's potence 0 fulfill a disjunction?
- Best way to implement Kleene star operation in Java
- Why can't the Kleene closure construction for an NFA be simplified?
- Deterministic Finite Automaton of Kleene Star
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?
As Welbog points out, L* can have any number of states. This is not necessarily obvious though, so we might as well try to prove it. The proof is simple: we will describe a sequence of regular languages such that the minimum number of states in a DFA for the Nth language is equal to N.
Our regular languages will be {a}, {aa}, {aaa}, ..., that is, the sequence of finite regular languages consisting of a single non-empty string taken from the language a*, in ascending order of length.
A minimal DFA for the language {a}* has one state (assuming alphabet {a}) which loops to itself on a.
A minimal DFA for the language {aa}* has two states: the initial state is still accepting but we need a non-accepting state to accept strings with a number of a's not evenly divisible by two.
Generally, a minimal DFA for the language {a^n}* has n states: the initial state is still accepting but we need n-1 non-accepting states to keep track of the value of |w| % n. We must keep track of this value so that we can know if we have seen a number of a's that is evenly divisible by n, and in a DFA the only way to keep track of the number of a's seen so far is by changing to a new unique state.
This constructive proof allows us to offer evidence that there is no upper limit on the size of a minimal DFA for L*: if there were such a limit with m states, we'd simply point out that the language (a^(m+1))* must have a larger DFA.