Date: 2012-09-03 08:07:06Formal languages Computer science Deterministic pushdown automaton Ω-automaton Pushdown automaton Omega language Nondeterministic finite automaton Context-free language Regular language Automata theory Theoretical computer science Models of computation | | Regularity Problems for Weak Pushdown ω-Automata and Games Extended VersionChristof L¨oding and Stefan Repke⋆ Lehrstuhl f¨ ur Informatik 7, RWTH Aachen, GermanyAdd to Reading ListSource URL: www.automata.rwth-aachen.deDownload Document from Source Website File Size: 436,66 KBShare Document on Facebook
|