Define a NFA as a collection of States, with a start state and final/accepting states. - Githubissues

mkpro118 / Regex-Engine

Regex Engine in C

MIT License

0 stars 0 forks source link

Define a NFA as a collection of States, with a start state and final/accepting states. #14

Closed mkpro118 closed 2 months ago