Two finite state machines are said to be equivalent if they :
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. Recognize the same set of tokens
Explanation
Two finite state machines are equivalent if they accept the same language (set of strings/tokens).
More Theory of Computation and Compilers questions
- The finite state machine given in figure below recognizes :
- A pushdown automata behaves like a Turing machine when the number of auxiliary memory is :
- Pushdown automata can recognize language generated by_________.
- To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :
- Consider the two grammars: G₁: S → SbS | a G₂: S → aB | ab, A → AAB | a, B → ABb | b Which of the following options is correct?
- Context-sensitive language can be recognized by a :