Incompleteness Theorems, Large Cardinals, and Automata over Finite Words

Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. In T. V. Gopal, Gerhard Jäger, Silvia Steila, editors, Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. Volume 10185 of Lecture Notes in Computer Science, pages 231-246, 2017. [doi]

@inproceedings{Finkel17,
  title = {Incompleteness Theorems, Large Cardinals, and Automata over Finite Words},
  author = {Olivier Finkel},
  year = {2017},
  doi = {10.1007/978-3-319-55911-7_17},
  url = {http://dx.doi.org/10.1007/978-3-319-55911-7_17},
  researchr = {https://researchr.org/publication/Finkel17},
  cites = {0},
  citedby = {0},
  pages = {231-246},
  booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
  editor = {T. V. Gopal and Gerhard Jäger and Silvia Steila},
  volume = {10185},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-319-55911-7},
}