Question

Determine equivalence classes of a regular language

Answer 1

Answer:

Explanation:

what are you saying

Answer 2

For a general approach I don't know anything better than constructing an automaton, minimizing it, and then recalculating the equivalence classes again. However, there are a few tricks that very often speed up this process, or sometimes even make it unnecessary. Still, this works only because the automatons you usually have to deal with are quite simple, if you were to do this for an automaton with a looooot of states, writing a computer program from scratch that does this would be faster.

Relevant intuition on regular languages:

The regular languages are, intuitively, languages which require only finite amount of information at any given time to decide whether the input belongs or not to the language.

To be more precise, finite amount of information means that there are finitely many variables, each having finitely many possible values. That means, if we take all the possible configurations, we still end up with finitely many states, and exactly that notion is exemplified by the finite automatons: each state corresponds to some configuration.