First Page | Document Content | |
---|---|---|
Date: 2014-04-30 05:42:23Büchi automaton Muller automaton Regular language Constructible universe Ordinal number Ω-automaton Complementation of Büchi automaton Automata theory Theoretical computer science Computer science | Toward a structure theory of ω-regular trace languages Namit Chaturvedi Frontiers of Recognizability 29 Apr. 2014Add to Reading ListSource URL: www.automata.rwth-aachen.deDownload Document from Source WebsiteFile Size: 755,06 KBShare Document on Facebook |