Programming Algorithms Question:
What are the two ways through which the Markov algorithm terminates?
Answer:
A Markov algorithm terminates in one of the two ways.
1) The last production is not applicable
2) A terminal production is applicable
A terminal production is a statement of the form x map to y., where x and y represent the strings in V* and the symbol “.” Immediately follows the consequences.
1) The last production is not applicable
2) A terminal production is applicable
A terminal production is a statement of the form x map to y., where x and y represent the strings in V* and the symbol “.” Immediately follows the consequences.
Previous Question | Next Question |
What is the general strategy for Markov Algorithm? | Define string in an algorithmic notation and an example to support it? |