@inproceedings{BerghoferR-TPHOLs09,
author={Stefan Berghofer and Markus Reiter},
title={Formalizing the Logic-Automaton Connection},
editor={S. Berghofer and T. Nipkow and C. Urban and M. Wenzel},
booktitle="Theorem Proving in Higher Order Logics (TPHOLs 2009)",
series={Lecture Notes in Computer Science},volume=5674,publisher={Springer-Verlag},year=2009,pages={147--163}}

@inproceedings{Boudet-Comon-CAAP96,
  author =	 {Alexandre Boudet and Hubert Comon},
  title =	 {Diophantine Equations, {Presburger} Arithmetic and
                  Finite Automata},
  editor =	 {H{\'e}l{\`e}ne Kirchner},
  booktitle =	 {Trees in Algebra and Programming - CAAP'96, 21st
                  International Colloquium, Proceedings},
  publisher =	 {Springer-Verlag},
  series =	 {Lecture Notes in Computer Science},
  volume =	 {1059},
  year =	 {1996},
  pages =	 {30-43}
}

@inproceedings{Klarlund-CSL97,
  author =	 {Nils Klarlund},
  title =	 {{Mona} {\&} {Fido}: The Logic-Automaton Connection in
                  Practice},
  editor =	 {Mogens Nielsen and Wolfgang Thomas},
  booktitle =	 {Computer Science Logic, 11th International Workshop,
                  CSL '97, Selected Papers},
  publisher =	 {Springer-Verlag},
  series =	 {Lecture Notes in Computer Science},
  volume =	 {1414},
  year =	 {1998},
  pages =	 {311-326}
}
