Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length.
- AOne
- BTwo
- CThree
- DFour
The string tokenizes as a, Aa, Abb, Aa, which is four letters.
MCQs, short and long questions from lecture 1.Lecture 1 ki MCQs, short aur long sawal.
9 MCQs · 5 short questions · 9 MCQs from past papers9 MCQs · 5 short sawal · 9 MCQs past papers se
Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length.
The string tokenizes as a, Aa, Abb, Aa, which is four letters.
If an alphabet has n number of letter, then number of strings of length m will be
Each of the m positions has n choices, giving n^m strings.
Auto Meta mean
Automata comes from a word meaning self-acting or automatic.
Σ = {a,bc,cc} has the letters
The alphabet lists three letters: a, bc and cc.
Length of strings, generated by infinite language is_______
An infinite language has infinitely many words, but each word has finite length.
Length of null string is
The null string Λ has no letters, so its length is 0.
Which statement is true?
Words are strings that belong to a language, so every word is a string but not the reverse.
Which of the following is not a word of language EQUAL?
abababa has four a's and three b's, so it is not in EQUAL.
In which of the following language Rev(s)=s
PALINDROME is the language of words equal to their own reverse.
No MCQs match this filter.Is filter mein koi MCQ nahi.
Is there any difference in PALINDROME and reverse of palindrome explain it?
PALINDROME is the language of all strings s over Σ with Rev(s) = s, e.g. aba, abba. Reversing a palindrome gives the same string, so the reverse of each word of PALINDROME is itself, and the reverse of the language PALINDROME is PALINDROME again; there is no difference.
What does an automaton mean?
An automaton is a machine (model) that works automatically: it reads input and changes state by fixed rules without human help.
Different between word and strings?
A string is any concatenation of a finite number of letters from the alphabet Σ (including the null string Λ). A word is a string that belongs to a particular language. So every word is a string, but a string is a word only if it is in the language.
What is meant by a "language" in automata?
A language is a set of strings (words) over an alphabet Σ, i.e. a subset of Σ*. The set of all words accepted by an automaton is the language recognized by that automaton.
What is meant by tokenizing a string?
Tokenizing is breaking a string into the letters of the alphabet Σ it is made of, e.g. over Σ = {a, bb} the string abba is tokenized as a, bb, a.
No long questions added yet.Abhi koi long sawal shamil nahi.