Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings

December 12, 2017 in by

by Arnaud Carayol, Christof Löding, Olivier Serre
Reference:
Arnaud Carayol, Christof Löding, Olivier Serre. Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS’16). ACM Press, July 2016. (To appear)
Bibtex Entry:
@string{jul="July"}
@inproceedings{CLS-lics16,
  author =        {Carayol, Arnaud and L{"o}ding, Christof and
                   Serre, Olivier},
  booktitle =     {{P}roceedings of the 31st {A}nnual {ACMslash IEEE}
                   {S}ymposium on {L}ogic {I}n {C}omputer {S}cience
                   ({LICS}'16)},
  month =         jul,
  note =          {To~appear},
  publisher =     {ACM~Press},
  title =         {Automata on Infinite Trees with Equality and
                   Disequality Constraints Between Siblings},
  year =          {2016},
  category =      {conf},
  wps =           {wp1},
  partners =      {RWTH},
  casstingpart =  {100},
}