@Article{         2018arXiv180410772C,
  Author        = "{Clemente}, L. and {Lasota}, S.",
  adsnote       = "Provided by the SAO/NASA Astrophysics Data System",
  adsurl        = "http://adsabs.harvard.edu/abs/2018arXiv180410772C",
  ArchivePrefix = "arXiv",
  date-added    = "2018-05-01 08:47:28 +0000",
  date-modified = "2018-05-01 08:47:28 +0000",
  EPrint        = "1804.10772",
  Journal       = "ArXiv e-prints",
  Keywords      = "Computer Science - Formal Languages and Automata Theory, Computer Science - Logic in Computer Science, F.1.1, F.4.1",
  Month         = "April",
  PrimaryClass  = "cs.FL",
  Title         = "{Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms}",
  Year          = "2018",
  File          = "1804.10772 (0) - a - a - n.pdf"
}

@Article{ 2018arXiv180410772C, Author = "{Clemente}, L. and {Lasota}, S.", adsnote = "Provided by the SAO/NASA Astrophysics Data System", adsurl = "http://adsabs.harvard.edu/abs/2018arXiv180410772C", ArchivePrefix = "arXiv", date-added = "2018-05-01 08:47:28 +0000", date-modified = "2018-05-01 08:47:28 +0000", EPrint = "1804.10772", Journal = "ArXiv e-prints", Keywords = "Computer Science - Formal Languages and Automata Theory, Computer Science - Logic in Computer Science, F.1.1, F.4.1", Month = "April", PrimaryClass = "cs.FL", Title = "{Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms}", Year = "2018", File = "1804.10772 (0) - a - a - n.pdf" }