E
[Ete02] Kousha Etessami. A Hierarchy of Polynomial-Time Computable Simulations for Automata. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 131-144. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Ete,
  author =              {Etessami, Kousha},
  title =               {A Hierarchy of Polynomial-Time Computable
                         Simulations for Automata},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {131-144},
  year =                {2002},
  month =               aug,
}
List of authors