Classifying Recognizable Infinitary Trace Languages Using Word Automata

December 16, 2017 in by

by Namit Chaturvedi, Marcus Gelderie
Reference:
Namit Chaturvedi, Marcus Gelderie. Classifying Recognizable Infinitary Trace Languages Using Word Automata. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS’14) — Part I, pages 171-182. Volume 8634 of Lecture Notes in Computer Science. Springer, August 2014.
Bibtex Entry:
@string{aug="August"}
@inproceedings{CG-mfcs14,
  address =       {Budapest, Hungary},
  author =        {Chaturvedi, Namit and Gelderie, Marcus},
  booktitle =     {{P}roceedings of the 39th {I}nternational {S}ymposium
                   on {M}athematical {F}oundations of {C}omputer
                   {S}cience ({MFCS}'14)~-- {P}art~{I}},
  editor =        {Csuhaj{-}Varj{'u}, Erzs{'e}bet and
                   Dietzfelbinger, Martin and {'E}sik, Zolt{'a}n},
  month =         aug,
  pages =         {171-182},
  publisher =     {Springer},
  series =        {Lecture Notes in Computer Science},
  title =         {Classifying Recognizable Infinitary Trace Languages
                   Using Word Automata},
  volume =        {8634},
  year =          {2014},
  doi =           {10.1007/978-3-662-44522-8_15},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  CG-mfcs14.pdf},
  category =      {conf},
  wps =           {wp1},
  partners =      {RWTH},
  casstingpart =  {100},
}