Register
Filter

Questions by One

3 votes
1 answer
1
what will be the true about given language
L={an bn ; n>=0, n is not multiple of 2} A.) CFL but not DCFL B.) Recursive but not CFL C.) DCFL hence a CFL D.) May or may ot be a CFL
L={an bn ; n>=0, n is not multiple of 2}A.) CFL but not DCFLB.) Recursive but not CFLC.) DCFL hence a CFLD.) May or may ot be a CFL
4 votes
1 answer
2
Consider the following regular expression R
R= a*b* + b*a* How many final states exist in the minimized DFA that accepts a language equivalent to R. How many equivalence classes of ∑* to represent a language which is equivalent to R.
R= a*b* + b*a*How many final states exist in the minimized DFA that accepts a language equivalent to R.How many equivalence classes of ∑* to represent a language which...
0 votes
1 answer
3
Find the number of states required in the minimized DFA
Let L be the language over {a,b} and it contains all strings with following rules. 1. Every string starts with "a" 2. Every string contains "ab" 3. Every string ends with "b" Find the number of states required in the minimized DFA that accepts L.
Let L be the language over {a,b} and it contains all strings with following rules.1. Every string starts with "a"2. Every string contains "ab"3. Every string ends with "b...
2 votes
1 answer
4
Find the no of strings in the following Language
Let L1=0*1* ,L2=1*0* ,L3=(0+1)* and L4=0*1*0*. Then Find The Number Of Strings In The Following Language L. L= (L1 ∩ L2) - (L3 ∩ L4)
Let L1=0*1* ,L2=1*0* ,L3=(0+1)* and L4=0*1*0*. Then Find The Number Of Strings In The Following Language L.L= (L1 ∩ L2) - (L3 ∩ L4)
2 votes
1 answer
5
How Many States required to construct equivalent DFA
L={am^n | n>=1,m>n} How Many States required to construct equivalent DFA?
L={am^n | n>=1,m>n}How Many States required to construct equivalent DFA?
0 votes
3 answers
6
Express the statement in logical expression
Express the statement "Everyone has exactly one best friend" as a logical expression involving predicates,quantifiers with a domain consisting of all people,and logical connectives without using uniqueness quantifier. I am confused pleased explain it
Express the statement "Everyone has exactly one best friend" as a logical expression involving predicates,quantifiers with a domain consisting of all people,and logical c...
2 votes
2 answers
7
Logically Equivalent justify your answer
1. (∀x (p(x) → q(x)) and (∀x p(x) → ∀x q(x)) 2.∃x p(x)∧∃x q(x) and ∃x (p(x)∧q(x)) 3.(∀x (p(x) ↔ q(x)) and (∀x p(x) ↔ ∀x q(x)) are logically equivalent or not justify the answer
1. (∀x (p(x) → q(x)) and (∀x p(x) → ∀x q(x))2.∃x p(x)∧∃x q(x) and ∃x (p(x)∧q(x))3.(∀x (p(x) ↔ q(x)) and (∀x p(x) ↔ ∀x q(x))are logically eq...
0 votes
1 answer
8
How many different truth table of compound propositions
How many different truth tables of compound propositions are there that involve the propositional variables p and q ?
How many different truth tables of compound propositions are there that involve the propositional variables p and q ?
2 votes
2 answers
9
Conditional Statements is a tautology or not without using truth table
1.$ [(p\to q)\wedge (q\to r)]\to (p\to r)$ 2. $[(p \vee q) \wedge (p \to r) \wedge (q \to r)] \to r$
1.$ [(p\to q)\wedge (q\to r)]\to (p\to r)$2. $[(p \vee q) \wedge (p \to r) \wedge (q \to r)] \to r$