Discrete Mathematics MCQs | Page - 31

Q. 301) If r is a regular expression then r* is a _______ expression.

Q. 302) An example for regular grammar is _____.

Q. 303) If all the productions have single non-terminal in the left hand side then the grammar defined is ________grammar.

Q. 304) In Backus Naur Form the symbol:: = is used instead of _______.

Q. 305) Any subset L of A* is called ________ over A.

Q. 306) Let S be a start symbol and S -> aA, A -> BA, A -> a, B -> b be the productions in a grammar then one of the string derived form the grammar is _____.

Q. 307) If S is a start symbol and S -> AB, A -> aB, B -> b are the productions then a string generated by the grammar is _______.

Q. 308) In FSA ,the notation for M being in state S0, reading the input symbol a, moving one cell right and reaching the state S1 is given by ________.

Q. 309) If "S -> aS, S -> a" are the productions in a grammar G, then the grammar is called_____.

Q. 310) The rank of the incidence matrix of any connected graph G with n vertices is ______.