autwords \- enumerate lasso-shaped words accepted by omega-automata
autwords [OPTION...] [FILENAME...]
autwords reads omega-automata and enumerates accepted words that have a lasso shape: a finite stem followed by a finite cycle that repeats forever. The lengths of the stem and cycle can be bounded using the --stem and --cycle options.
Enumerate lasso-shaped accepted words of ω-automata, printing one word per line.
-F, --file=FILENAME
process the automaton in FILENAME
--trust-hoa=BOOL
If false, properties listed in HOA files are ignored, unless they can be easily verified. If true (the default) any supported property is trusted.
--cycle=RANGE
restrict cycle length to RANGE (default: 1..)
--stem=RANGE
restrict stem length to RANGE (default: 0..)
RANGE may have one of the following forms: ’INT’, ’INT..INT’, ’..INT’, or ’INT..’
-c, --count
print only a count of words per automaton (may not terminate if the size of the words is not restrictued)
-n, --max-count=NUM
stop after outputting NUM words per automaton
-o, --output=FILENAME
write output to FILENAME instead of standard output
|
--help |
print this help |
--version
print program version
Mandatory or optional arguments to long options are also mandatory or optional for any corresponding short options.
|
0 |
if some words were output | ||
|
1 |
if no words were found (language is empty within the given bounds) | ||
|
2 |
if any error has been reported |
Report bugs to <spot@lrde.epita.fr>.
Copyright
© 2026 by the Spot authors, see the AUTHORS File for
details. License GPLv3+: GNU GPL version 3 or later.
This is free software: you are free to change and
redistribute it. There is NO WARRANTY, to the extent
permitted by law.