1 [NAME]
2 genaut \- generate ω-automata from scalable patterns
3 [DESCRIPTION]
4 .\" Add any additional description here
5 [BIBLIOGRAPHY]
6 Prefixes used in pattern names refer to the following papers:
7 .TP
8 ks
9 D. Kuperberg, M. Skrzypczak: On Determinisation of Good-for-Games
10 Automata.  Proceedings of ICALP'15.
11 .TP
12 l
13 C. Löding: Optimal Bounds for Transformations of ω-Automata.
14 Proceedings of FSTTCS'99.
15 .TP
16 m
17 M. Michel: Complementation is more difficult with automata on
18 infinite words.  CNET, Paris (1988).  Unpublished manuscript.
19 
20 [SEE ALSO]
21 .BR autfilt (1),
22 .BR genltl (1),
23 .BR randaut (1),
24 .BR randltl (1)
25