Test my Merit My Results Create Exam

Higher Study | Theory of Computation | Regular Languages and Finite Automata

Consider the following Deterministic Finite Automaton M. Let S denote the set of eight-bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M is
Which of the following languages over the alphabet ∑ = {0, 1} is regular? I. 0n1m II. 0n1m where m = n + 1 III. 0m1n where m ≡ n (mod 3).
Identify the language generated by the following grammar, where S is the start variable. S → XY X → aX | a Y → aYb | ϵ
Let L be the language represented by the regular expression Σ∗0011Σ∗ where Σ={0, 1}. What is the minimum number of states in a DFA that recognizes L̅ (complement of L)?
Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
What is the complement of the language accepted by the NFA shown below? Assume ∑ = {a} and ϵ is the empty string
How many states are there in a minimum state deterministic finite automaton accepting the language L = {w | ∈ (0,1)*, number of 0's is divisible by 2, and number of 1's is divisible by 5, respectively}?
Consider the FA shown in fig below which language is accepted by the FA:
Let w be any string of length n in {0, 1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
What is the type of strings accepted by the following finite automata?
Which one of the following regular expressions correctly represents the language of the finite automaton given below?
Which of the following statements about Regular Expression is/are incorrect? A. The union of two regular expressions is also a regular expression B. The concatenation of two regular expressions is also a regular expression C. The iteration of a regular expression is also a regular expression
Which of the following represents the language corresponding to the regular expression r =(aa)* (bb)* b ?
Which of the followings is a regular grammar?
Which of the following statement(s) is/are TRUE? (i) For every NFA with an arbitrary number of final states, there is an equivalent NFA with only one final state. (ii) A language that is accepted by a DFA will also be accepted by some NFA.
Ads