Closes #215

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.

Introduce a new algorithm, regexp::properties::LanguageIsEpsilon to
check whether a language of a regexp is exactly equal to a language of
epsilon regexp.
This will be later useful in checking whether the language of a regexp
is infinite.

Similarly to previous commit, let's make this clear. We are soon going
to add a new algorithm that will check if the language is equal to
epsilon, so let's differentiate.

The name regexp::properties::RegExpEmpty is not that expressive. Let's
make clear what is going on.

Jan Trávníček authored 3 years ago and Jan Trávníček committed 3 years ago

breaking change!

In the context the order of iterators is that the returned value is
always positive

... because most developers were copy-pasting the preambule anyway and
did not pay any attention to change it.

Also, I think that git does better job in managing that.

The case (b*+a)* was only optimized to (b+a)* by lemma V4.

Tomáš Pecka authored 4 years ago and Jan Trávníček committed 4 years ago

Although #pragma once is not a standard, compilers nowadays usually
support it. We don't have any tricky build system so we should be OK.

This also fixes many errors regarding using reserved identifiers (names
starting with double underscore).