Tomáš Pecka
authored
This new easy algorithm checks whether a regexp's language is an infinite language. Also adding an AQL test to compare with the same algorithm on finite automata.
Code owners
Assign users and groups as approvers for specific file changes. Learn more.
| Name | Last commit | Last update |
|---|---|---|
| .. | ||
| aql | ||
| cppaql | ||
| testing | ||
| CMakeLists.txt | ||
| aql.cpp.in | ||
| configure_tests.hpp.in | ||
| testing.h | ||