Separate complement using brzozowski minimization from classical complement

VeriFIT / mata

A fast and simple automata library

MIT License

14 stars 11 forks source link

Open Adda0 opened 1 week ago

Adda0 commented 1 week ago

This PR:

optimizes removal of elements from sparse set by not checking for element existence multiple times.
adds a method to swap final and non-final states in the automaton, as requested by #342.
adds a convenience function to compute a complement of a DFA in-place, as requested by #342.
extracts complement using Brzozowski minimization into a separate function, as requested by #342.
removes an unnecessary use of dynamic memory from #406.

This PR resolves #342.

jurajsic commented 2 days ago

I think we can merge this.

Adda0 commented 2 days ago

I will. I discussed with Lukáš that we will review the most important changes later on when he has a bit of time to spare.