Alphabetical Satisfiability Problem for Trace Equations

Luca Breveglieri, Alessandra Cherubini, C. Nuccio, E. Rodaro. Alphabetical Satisfiability Problem for Trace Equations. Acta Cybern., 19(2):479-497, 2009. [doi]

@article{BreveglieriCNR09,
  title = {Alphabetical Satisfiability Problem for Trace Equations},
  author = {Luca Breveglieri and Alessandra Cherubini and C. Nuccio and E. Rodaro},
  year = {2009},
  url = {http://www.inf.u-szeged.hu/actacybernetica/edb/vol19n2/Breveglieri_2009_ActaCybernetica.xml},
  tags = {C++, e-science},
  researchr = {https://researchr.org/publication/BreveglieriCNR09},
  cites = {0},
  citedby = {0},
  journal = {Acta Cybern.},
  volume = {19},
  number = {2},
  pages = {479-497},
}