0 votes 0 votes Theory of Computation grammar + – Saikat Dutta asked Nov 15, 2017 • retagged Jul 12, 2019 by Cristine Saikat Dutta 245 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Akash Mittal commented Nov 15, 2017 reply Follow Share both are finite. there is no loop in CNF graph 1 votes 1 votes abhishek tiwary commented Nov 19, 2017 reply Follow Share CNF is a tree that has maximum 2 desecendent and there is no loop so finite 0 votes 0 votes Please log in or register to add a comment.
