1,243 views
0 votes
0 votes

Is this language a regular language ? If yes why and if No why ?

The last part is “x!=y” cropped in the picture

According to my understanding this is not regular because its says

number of x = number of y

But Finite automata cant compare the number of x and y here with limited memory. Can you please explain ?

1 Answer

0 votes
0 votes

IT IS NOT REGULAR .

As finite automata is memory less model

it have no any memory to know that how much number of x so how it able to compute that must equal to y an in given question its |x| = |y| mean cardinality of x and cardinality of y must same but its not possible

Related questions

5 votes
5 votes
1 answer
1
0 votes
0 votes
0 answers
3
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
0 votes
0 votes
1 answer
4