Tagged Questions
2
votes
1answer
47 views
Is regularity is preserved under reversal?
When talking about languages and regular languages.
Can I say that reversal preserved regularity since if the language L is regular, we can generate it by right linear grammar.
Therefore, the ...
1
vote
2answers
54 views
Solve right linear set equations
Trying to solve this set of equations. I'm feeling like I'm making it so complicated.
Of course + is union. Am I on the right track?
A = 0B + 1D
B = 0C + 1A
C = 0A + 1B + λ
D = OD + 1C + λ
A ...
1
vote
1answer
43 views
Show Two f.s.a. machines accept different input
I'm trying to solve it for two hours already. I know it somehow related to the pumping lemma
Let $M_1 = \langle Q_1,S,f_1,s_1,F_1\rangle$ and $M_2 = \langle Q_2,S,f_2,s_2,F_2\rangle$ be two machines, ...
1
vote
1answer
233 views
Show two finite state machines are equivalent
Suppose $M_1 = \langle Q_1,S,R,f_1,g_1\rangle$ and $M_2 = \langle Q_2,S,R,f_2,g_2\rangle$ are two strongly connected machines.
I need to show that $M_1 \equiv M_2$ iff there exist a state $p \in Q_1$ ...
0
votes
1answer
67 views
Finding if two machines can be equivalent
I have this problem:
Consider the following machines M1 and M2.
M1 has initial state A and the initial state of M2 is unspecified.
Can the machines be made equivalent by the correct choice of ...
1
vote
0answers
88 views
Confusion related to state equivalence of finite state machines
I have this confusion if there are two states of a machine p and q. Let x be an input string such that length of x = k, g be the output function and let g(p,x) and g(q,x) be the output when the input ...
