Date: 2012-05-29 11:02:51Formal languages Computer science Theory of computation Ω-automaton Omega language Büchi automaton Symbol Determinacy Regular language Automata theory Mathematics Theoretical computer science | | Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas}@automata.rwth-aacheAdd to Reading ListSource URL: www.automata.rwth-aachen.deDownload Document from Source Website File Size: 380,17 KBShare Document on Facebook
|