search

leonbohn / automata

MIT License
4 stars 0 forks source link

Add `Packed` transition system #95

Closed leonbohn closed 2 months ago

leonbohn commented 2 months ago

A new implementation of TransitionSystem. This stores all edges in a continuous array which allows for linear access time. This requires the size of the alphabet to be known beforehand and is only possible for SimpleAlphabets