View more random threads:
- CS304 Object Oriented Programming Quiz No.3 Solution Fall...
- Check Online MTH202 Discrete Mathematics Quiz No.1...
- ENG201 Paper 26 May,2010
- Helping Materail MCQ's of SOS101 Introduction to sociology...
- FIN630 - Investment Analysis & Portfolio Management Today...
- PHY301 Circuit Theory Quiz No.2 and Solution Fall Semester...
- Mcs
- MTH603 Numerical Analysis Solve Quiz No.3 Fall Semester 2013
- MGT411 - Money & Banking Graded Discussion Board (GDB)...
- MTH202 MCS Semester 1 Old papers of 2009
CS402 Theory of Automata Quiz No.1 Fall Semester 2012
1) The minimum length of the strings(except null string) of a language that starts and ends in the same letters will be
2) Decomposing a string into its valid units is referred as:
3) Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum ______________ number of states.
2
3
more than 3.
none of them
4) A string will be accepted by an NFA if there exist _______one successful path.
5) If R is a regular language and L is some language, and L U R is a _______, then L must be a ________.Regular language
6) Closure of an FA, is same as ___________ of an FA with itself, except
that the initial state of the required FA is a final state as well.
Select correct option:
Union
Sum
Concatenation (answer)
Intersection
7)If we have a finite language and the number of states in the FA is n then the maximum number of letters in the each word of the language that will be accepted by the given FA will be覧覧覧覧-
8) If R is a regular language and L is some language, and L U R is a regular language, then L must be a regular language.
Choices:
Sponsored Links
True
9) The minimum length of the strings(except null string) of a language that starts and ends in different letters will be:
10) If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings
11) Decomposing a string into its valid units is referred as:
12) The minimum length of the strings(except null string) of a language that starts and ends in the same letters will be
There are currently 1 users browsing this thread. (0 members and 1 guests)