@InProceedings{	  mus94,
  author	= "Anca Muscholl",
  title		= "On the complementation of {B\"u}chi asynchronous cellular
		  automata",
  booktitle	= "Proc. 21st International Colloquium Automata, Languages
		  and Programming (ICALP'94), Jerusalem",
  year		= "1994",
  pages		= "142--153",
  series	= "Lecture Notes in Computer Science",
  editor	= "S. Abiteboul and E. Shamir",
  volume	= "820",
  publisher	= "Springer-Verlag",
  doi		= "10.1007/3-540-58201-0_64",
  abstract	= "We present direct subset automata constructions for
		  asynchronous (asynchronous cellular, resp.) automata. This
		  provides a solution to the problem of direct
		  determinization for automata with distributed control for
		  languages of finite traces. We use the subset automaton
		  construction and apply Klarlund's progress measure
		  technique in order to complement non-deterministic
		  asynchronous cellular B{\"u}chi automata for infinite
		  traces. Both constructions yield a super-exponential
		  blow-up in the size of local states sets."
}