Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata

Tushant Jha, Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch. Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata. In Alex Norta, Walid Gaaloul, G. R. Gangadharan, Hoa Khanh Dam, editors, Service-Oriented Computing - ICSOC 2015 Workshops - WESOA, RMSOC, ISC, DISCO, WESE, BSCI, FOR-MOVES, Goa, India, November 16-19, 2015, Revised Selected Papers. Volume 9586 of Lecture Notes in Computer Science, pages 145-156, Springer, 2015. [doi]

@inproceedings{JhaBCR15,
  title = {Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata},
  author = {Tushant Jha and Walid Belkhir and Yannick Chevalier and Michaël Rusinowitch},
  year = {2015},
  doi = {10.1007/978-3-662-50539-7_12},
  url = {http://dx.doi.org/10.1007/978-3-662-50539-7_12},
  researchr = {https://researchr.org/publication/JhaBCR15},
  cites = {0},
  citedby = {0},
  pages = {145-156},
  booktitle = {Service-Oriented Computing - ICSOC 2015 Workshops - WESOA, RMSOC, ISC, DISCO, WESE, BSCI, FOR-MOVES, Goa, India, November 16-19, 2015, Revised Selected Papers},
  editor = {Alex Norta and Walid Gaaloul and G. R. Gangadharan and Hoa Khanh Dam},
  volume = {9586},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-50538-0},
}