Automata Theory Converting Regular Expressions Automata Online Exam Quiz
Automata Theory Converting Regular Expressions Automata GK Quiz. Question and Answers related to Automata Theory Converting Regular Expressions Automata. MCQ (Multiple Choice Questions with answers about Automata Theory Converting Regular Expressions Automata
The following is/are an approach to process a regexp:
Options
A : Contruction of NFA and subsequently, a DFA.
B : Thompson’s Contruction Algorithm
C : Both (a) and (b)
D : None of the mentioned
Which of the following are not quantifiers?
Options
A : Kleene plus +
B : Kleene star *
C : Question mark ?
D : None of the mentioned
Which of the following cannot be used to decide whether and how a given regexp matches a string:
Options
A : NFA to DFA
B : Lazy DFA algorithm
C : Backtracking
D : None of the mentioned
Which of the following languages have built in regexps support?
Options
A : Perl
B : Java
C : Python
D : C++
What kind of expressions do we used for pattern matching?
Options
A : Regular Expression
B : Rational Expression
C : Regular & Rational Expression
D : None of the mentioned
Which of the following do Regexps do not find their use in?
Options
A : search engines
B : word processors
C : sed
D : none of the mentioned
Conversion of a regular expression into its corresponding NFA :
Options
A : Thompson’s Construction Algorithm
B : Powerset Construction
C : Kleene’s algorithm
D : None of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Cfl Substitution Theorem
Automata Theory Chomsky Normal Form
Automata Theory Construction Yield Parse Tree
Automata Theory Context Free Grammar Derivations Definitions
Automata Theory Deterministic Pda
Automata Theory Dfa Processing Strings
Automata Theory Dfa Regular Expressions