We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
In AutomataLib, an alphabet is a finite ordered set of input symbols. Mathematically, it can be described as a set S = { a_1, ..., a_n }.
S = { a_1, ..., a_n }