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 best solutions below
Related Questions in AUTOMATA
- L = {www| w belongs to {0,1}*} prove via pumping lemma
- How to design a regex used for searching a pattern, rather than validating a pattern?
- Is $E_{LBA}$ a Turing recognizable language?
- Bisimulation in state transition system
- Lexical analyser : how to identify the end of a token
- Is ε terminal in context-free?
- How can I build string matching tree from array of regex-es?
- Simple explanation of PDA accept states?
- automata theorem: existance of a DFA
- Design DFA that checks wheter a boolean formula is true or false
- DFA that contains 1101 as a substring
- Number of Turing Machines?
- 1 or 2 right hand side variable in Context free language
- I'm trying to solve DFA
- Automata on ruby
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
- 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
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?
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*).