8 Let H0ab H1ebr Let Lababbababr H1l The Language Of Two Zeroes #364
8. Let h(0)=ab; h(1)=e<br /> Let L={abab,baba}<br /> h-1(L)= the language of two zeroes and any number of one’s.<br /> The given example belongs to which of the following?
This multiple choice question (MCQ) is related to the book/course gs gs101 Automata Theory. It can also be found in gs gs101 Properties of Regular Languages - Reversal-Homomorphism and Inverse Homomorphism - Quiz No.1.
8. Let h(0)=ab; h(1)=e
Let L={abab,baba}
h-1(L)= the language of two zeroes and any number of one’s.
The given example belongs to which of the following?
Let L={abab,baba}
h-1(L)= the language of two zeroes and any number of one’s.
The given example belongs to which of the following?
Homomorphism
Inverse Homomorphism
Homomorphism and Inverse Homomorphism
None of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes