A program for constructing an inexhaustible state automaton from regular grammar?

Is this it? I don't know, haha.

Formal definition of language.

The alphabet is an arbitrary finite set, representing empty strings, denoted as 0, and strings with a total length of n are n, which is 0 1 ....n ∪…Language l is defined as any subset of .

Note: The empty subset of and are two different languages.

Interlinguistic computations.

Operations between languages are operations on power sets.

Intersection and complementation of string sets.

Join operations: l 1 l 2 = .

Power operation: l n = l ....l (n l connected together), l 0 = .

Closure arithmetic: l * = l 0 l 1 ....l n ∪…

Right) quotient operation: l 1 l 2 = .

The representation of the language.

A formal language can qualify itself in a number of ways, such as:

Enumerate individual strings (only for limited string sets).

It is produced by formal grammar (see Chomsky genealogy).

Generated by regular expressions.

It is identified by some kind of automata, such as a Turing machine or a finite-state automata. Automaton.

Master Assad sent Stephen away.

Insert the card and wait.

Enter the password to confirm.

I'll see what to do later.

You have a bit of a sense of humor.

So stupid???

I'm also begging for this program, is there any source code.

This regular meaning:

Match 01 appears 0 times or an unlimited number of times.

Match 000

The regex is the same in all languages, and the regex is written like this.

lqq, the face of the division has made you lose it.

Comrade! Are you a 09 pilot? 5555555555555555555555555555555 our lives are miserable!!

Ha ha. It's really all Shida.

is the same person who has fallen to the end of the world, why should we have known each other when we meet.

09 Computer students can't afford it.

Hahaha, at first glance, it's all from the teacher's university.