Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Tarunreddy
1
votes
1
MADE EASY 2022 Work book -Theory of Computation series
Let L be a regular language on alphabet Σ. The union of the myhill-nerode equivalence classes is always _____, and the pairwise intersection of the myhill-nerode equivalence classes is always Fill up the blanks
Let L be a regular language on alphabet Σ. The union of the myhill-nerode equivalence classes is always _____, and the pairwise intersection of the myhill-nerode equival...
403
views
answered
Oct 12, 2022
Theory of Computation
theory-of-computation
regular-languages
finite-automata
minimal-state-automata
decidability
+
–
1
votes
2
GO Classes Test Series 2024 | Discrete Mathematics | Test 3 | Question: 3
$(\text{Q}, \ast)$ is an algebraic structure where $\text{Q}$ represents rational numbers and $\ast$ denotes multiplication. Which one of the following statements is true? $\text{Q}$ is an abelian group. $\text{Q}$ is a group but not abelian. $\text{Q}$ is a semigroup but not a monoid. $\text{Q}$ is monoid but not group.
$(\text{Q}, \ast)$ is an algebraic structure where $\text{Q}$ represents rational numbers and $\ast$ denotes multiplication. Which one of the following statements is true...
554
views
answered
Aug 15, 2022
Set Theory & Algebra
goclasses2024-dm-3-weekly-quiz
goclasses
set-theory&algebra
group-theory
abelian-group
1-mark
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register