Weak alternating automata are not that weak

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Transactions on Computer Logic

Weak alternating automata are not that weak

Orna Kupferman, Moshe Y. Vardi

Journal Title: ACM Transactions on Computer Logic

Date: 2001

Volume: 2

Issue: 3

p. 408 - 429

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.cs.rice.edu/~vardi/papers/istcs97.ps.gz

http://www.cs.rice.edu/~vardi/papers/istcs97rj.ps.gz

http://www.cs.rice.edu/~vardi/papers/istcs97rj.ps.gz/kupferman97weak.ps

For further information about this item go to:

http://doi.acm.org/10.1145/377978.377993

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12