Weak alternating automata and tree automata emptiness

Abstract

Article Weak alternating automata and tree automata emptiness Share on Authors: Orna Kupferman EECS Department, UC Berkeley, Berkeley CA EECS Department, UC Berkeley, Berkeley CAView Profile , Moshe Y. Vardi Department of Computer Science, Rice University, Houston, TX Department of Computer Science, Rice University, Houston, TXView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 224–233https://doi.org/10.1145/276698.276748Online:23 May 1998Publication History 65citation709DownloadsMetricsTotal Citations65Total Downloads709Last 12 Months11Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access