recategorized by
15,279 views

2 Answers

2 votes
2 votes

Two finite state machine are said to be equivalent if, starting from their respective initial statesthey will produce the same output sequence when they are given the same input sequence. That implies they must recognize the same set of tokens . 

Related questions

0 votes
0 votes
2 answers
1
0 votes
0 votes
6 answers
2
0 votes
0 votes
3 answers
3
Pooja Khatri asked Jul 13, 2018
3,224 views
Pushdown automata can recognize language generated by _______Only context free grammarOnly regular grammarContext free grammar or regular grammarOnly context sensitive gr...
0 votes
0 votes
1 answer
4
Pooja Khatri asked Jul 13, 2018
1,241 views
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is$2n-1$$2n$$n+1$$n^2$