There is a DFA.
But I don't know this DFA means.
I want to know this DFA's Regular expression and description
(Description like 'this automata accept suffix is 011)
Blue state is start state and red states are accept states.
see the link below....it will tell about DFA.
http://en.wikipedia.org/wiki/Deterministic_finite_automaton
Related
As we know, the definition of 'finite state automata' is:
Then we have this finite state automat described as:
Then we have the conclusion:
Question is : Instead of accept an empty string, what if the automat first read string is '2', which is not belong to the alphabet(0,1) of this automata. will this automata still go to accept state?
pics quoted from book <Introduction to the Theory of Computation>
When a machine is defined, one of its items is the alphabet (second one in your definition). We are not allowed to test our machine outside the scope of the alphabet. Therefore, all strings of L (accepted strings) and L-bar (rejected strings) should come out of Sigma-start.
While converting NFA to DFA we sometimes have to make a new state in order to achieve it. What exactly is that new state?
Like, {q0, q1, q2} is a new state. Does it mean, in that state we can achieve q0 or q1 or q2...or what?
yes,in NFA there are long way or not minimal way to execute string so, some times when you convert to DFA, some group of states ex{q0,q1,q2} are converted to one state so you can achive minimal automation.for ex. consider this NFA.
it will be converted to DFA like this.
Does exists one algorithmic to convert a Linear Grammar Right to the equal Linear Grammar Left?
For every right-linear grammar, there exists an equivalent left-linear grammar that generates the same language, and vice-versa.
Use the grammar to build the FSA that recognizes the language generated by the original grammar.
Swap initial states with final states.
Invert arrows orientation.
If multiple initial states are present, set them as not initial, create a dummy initial state and link it with them using spontaneous moves.
From the modified FSA, obtain another right-linear grammar, using the "standard" approach.
Reverse the right side of every production of the grammar.
You should get an equivalent left-linear grammar.
I'm beginner for Automata and JFLAP. I have action Finite Automata which tells that on any character in the language, it must go to another state. How am I implement this on JLAP.Thanks
I am preparing contex free grammar for an exam. I couldn't understand why the language
{ a^n b^n | n>=0}
is context free but not regular. Why is it not regular?
When can we say that an expression is not regular?
Thanks
An expression is not regular if it cannot be matched (exactly) by a regular expression or (equivalently) a finite state machine. See also context free language and regular language.
Like said in previous answers, its context free because you can express it with context free grammar.
For example: S -> aSb | ε
Its not regular because you cannot express it with finite state machine nor regular expressions. You should be able to count the number of As and check that number of Bs match. This cannot be done with finite states as n could be anything
The standard approach is to use the Pumping Lemma
Well you can say it is context free because you can express it using a Context-Free Grammar. It is not regular however because a regular expression (and finite automata) can not represent that language.