COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
If it is accepted by automata
|
|
|
If it halts
|
|
|
If automata touch final state in its life time
|
|
|
All language are language of automata
|
Detailed explanation-1: -Explanation: If automata starts with starting state and after finite moves if reaches to final step then it called accepted. Explanation: If a string accepted by automata it is called language of automata.
Detailed explanation-2: -The language accepted by an automaton is the set of strings it accepts. So, for an automaton to accept a particular language (e.g., anbn∣n≥1), it must not only accept every string in the language, but also reject every string not in the language.
Detailed explanation-3: -The language accepted by finite automata can be easily described by simple expressions called Regular Expressions. It is the most effective way to represent any language. The languages accepted by some regular expression are referred to as Regular languages.
Detailed explanation-4: -A language is a regular language if there is a finite automaton that recognizes it. For example, this machine recognizes the language of strings that have an even number of zeroes since any string that has an even number of zeroes will go from the start state to an accepting state.
Detailed explanation-5: -Regular Language: All languages accepted by a finite automaton or regular grammar is Regular Language. Finite Automaton: It is also called a Finite State Machine (FSM).