VeriFIT / mata

A fast and simple automata library
MIT License
20 stars 13 forks source link

Get arbitrary word using DFS #413

Closed Adda0 closed 3 months ago

Adda0 commented 3 months ago

This PR adds a method to get an arbitrary word accepted by an NFA using DFS. Since we are using a bit vector of searched states, the NFA does not need to be trimmed to prevent cycling in DFS.

This PR resolves #411.

Adda0 commented 3 months ago

Since the addition of the new method was approved, I will merge the trimmed PR.