What is the difference between (ab)* and [ab]* when we write in Automata regular expression? In my opinion, they both mean ab zero or more times, but they don't.
Using bracket for automata
91 views Asked by Duy Duy At
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 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?
Popular Tags
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)
According to the POSIX Basic Regular Expression syntax, they differ as follows:
[ ]) you pick only one of the characters:For round brackets (
( )) characters are grouped together to act as a single entity:(Quote slightly adapted)
Therefore,
(ab)*works as you said, producing "ab" zero or more times.But
[ab]*would likely mean "either "a" zero or more times, or "b" zero or more times". In other words,(a*)|(b*).