[AEC16]
3rd Algorithmic and Enumerative Combinatorics
Summer School 2016
(2016)
(Accessed: 2018-07-01),
https://www.risc.jku.at/conferences/aec2016/.
[Büc60] Büchi, J. R., Weak Second-Order Arithmetic and Finite Automata, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6 (6) (1960), 66–92.
[DEG+02] Dobkin, D., Ellson, J., Gansner, E., Koutsofios, E., North, S. and Woodhull, G., Graphviz – Graph Drawing Programs, AT&T Research and Lucent Bell Labs (2002), https://www.graphviz.org/.
[DLM11] Delgado, M., Linton, S. and Morais, J.,
Automata, A package on automata, Version 1.13
(2011)
(Refereed GAP package),
http://www.fc.up.pt/cmup/mdelgado/automata/.
[HMU01] Hopcroft, J. E., Motwani, R. and Ullman, J. D., Introduction to Automata Theory, Languages, and Computation, Cengage Learning, 2nd edition, Boston, MA, USA (2001).
[Koz97] Kozen, D. C., Automata and Computability, Springer-Verlag, 1st edition, Berlin, Heidelberg (1997).
[Pip97] Pippenger, N., Theories of Computability, Cambridge University Press, 1st edition, New York, NY, USA (1997).
[Pre29] Presburger, M., Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, in Comptes Rendus du I congrès de Mathématiciens des Pays Slaves, , Warszawa (1929), 92–101.
[Sha13] Shallit, J. (Bulatov, A. A. and Shur, A. M., Eds.), Decidability and Enumeration for Automatic Sequences: A Survey, in Computer Science – Theory and Applications, Springer-Verlag, Berlin, Heidelberg (2013), 49–63.
[Sta84] Stansifer, R.,
Presburger's Article on Integer
Airthmetic: Remarks and Translation,
Cornell University, Computer Science Department (TR84-639)
(1984)
(Accessed: 2018-07-01),
https://cs.fit.edu/~ryan/papers/presburger.pdf.
generated by GAPDoc2HTML