References

  1. Sara Baase (1988): Computer Algorithms: Introduction to Design and Analysis, 2nd edition. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.
  2. Matthias Felleisen, Robert Bruce Findler, Matthew Flatt & Shriram Krishnamurthi (2001): How to Design Programs: An Introduction to Programming and Computing, First edition. MIT Press, Cambridge, MA, USA.
  3. Matthias Felleisen, Robert Bruce Findler, Matthew Flatt & Shriram Krishnamurthi (2018): How to Design Programs: An Introduction to Programming and Computing, Second edition. MIT Press, Cambridge, MA, USA.
  4. Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi, Eli Barsilay, Jay McCarthy & Sam Tobin-Hochstadt (2018): A Programmable Programming Language. Commun. ACM 61(13), pp. 62–71, doi:10.1145/3127223.
  5. Ganesh Gopalakrishnan (2006): Computation Engineering, 1st edition. Springer-Verlag US, USA.
  6. Michael T. Grinder (2003): A Preliminary Empirical Evaluation of the Effectiveness of a Finite State Automaton Animator. SIGCSE Bull. 35(1), pp. 157–161, doi:10.1145/792548.611958.
  7. C. A. R. Hoare (1969): An Axiomatic Basis for Computer Programming. Commun. ACM 12(10), pp. 576–580, doi:10.1145/363235.363259.
  8. John Hughes (2016): Experiences with QuickCheck: Testing the Hard Stuff and Staying Sane. In: Sam Lindley, Conor McBride, Philip W. Trinder & Donald Sannella: A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 9600. Springer, pp. 169–186, doi:10.1007/978-3-319-30936-1_9.
  9. Donald E. Knuth, James H. Morris & Vaughan R. Pratt (1977): Fast Pattern Matching in Strings. SIAM Journal on Computing 6(2), pp. 323–350, doi:10.1137/0206024.
  10. Harry R. Lewis & Christos H. Papadimitriou (1997): Elements of the Theory of Computation, 2nd edition. Prentice Hall PTR, Upper Saddle River, NJ, USA, doi:10.1145/300307.1040360.
  11. Peter Linz (2011): An Introduction to Formal Languages and Automata, 5th edition. Jones and Bartlett Publishers, Inc., USA.
  12. Marco T. Morazán (2010): Functional Video Games in the CS1 Classroom. In: Rex L. Page, Zoltán Horváth & Viktória Zsók: Trends in Functional Programming - 11th International Symposium, TFP 2010, Norman, OK, USA, May 17-19, 2010. Revised Selected Papers, Lecture Notes in Computer Science 6546. Springer, pp. 166–183, doi:10.1007/978-3-642-22941-1_11.
  13. Marco T. Morazán (2011): Functional Video Games in CS1 II. In: Ricardo Peña & Rex L. Page: Trends in Functional Programming, 12th International Symposium, TFP 2011, Madrid, Spain, May 16-18, 2011, Revised Selected Papers, Lecture Notes in Computer Science 7193. Springer, pp. 146–162, doi:10.1007/978-3-642-32037-8_10.
  14. Marco T. Morazán (2013): Functional Video Games in CS1 III - Distributed Programming for Beginners. In: Jay McCarthy: Trends in Functional Programming - 14th International Symposium, TFP 2013, Provo, UT, USA, May 14-16, 2013, Revised Selected Papers, Lecture Notes in Computer Science 8322. Springer, pp. 149–167, doi:10.1007/978-3-642-45340-3_10.
  15. Marco T. Morazán (2015): Generative and accumulative recursion made fun for beginners. Comput. Lang. Syst. Struct. 44, pp. 181–197, doi:10.1016/j.cl.2015.08.001.
  16. Marco T. Morazán (2017): Vector Programming Using Structural Recursion. In: Simon Thompson: Proceedings Sixth Workshop on Trends in Functional Programming in Education, TFPIE@TFP 2017, Canterbury, Kent UK, 22 June 2017, EPTCS 270, pp. 1–17, doi:10.4204/EPTCS.270.1.
  17. Marco T. Morazán (2018): Infusing an HtDP-based CS1 with Distributed Programming Using Functional Video Games. J. Funct. Program. 28, pp. e5, doi:10.1017/S0956796818000059.
  18. Marco T. Morazán (2018): Vector Programming Using Generative Recursion. In: Peter Achten & Heather Miller: Proceedings Seventh International Workshop on Trends in Functional Programming in Education, TFPIE@TFP 2018, Chalmers University, Gothenburg, Sweden, 14th June 2018, EPTCS 295, pp. 35–51, doi:10.4204/EPTCS.295.3.
  19. Marco T. Morazán & Rosario Antunez (2014): Functional Automata - Formal Languages for Computer Science Students. In: James Caldwell, Philip K. F. Hölzenspies & Peter Achten: Proceedings 3rd International Workshop on Trends in Functional Programming in Education, EPTCS 170, pp. 19–32, doi:10.4204/EPTCS.170.2.
  20. Marco T. Morazán & Josephine A. Des Rosiers (2019): FSM Error Messages. EPTCS 295, pp. 1–16, doi:10.4204/EPTCS.295.1. Available at https://arxiv.org/abs/1906.11421v1.
  21. Maxim Mozgovoy (2009): Algorithms, Languages, Automata, & Compilers: A Practical Approach, 1st edition. Jones and Bartlett Publishers, Inc., USA.
  22. Elaine Rich (2019): Automata, Computability and Complexity: Theory and Applications. Pearson Prentice Hall.
  23. Susan H. Rodger (2006): JFLAP: An Interactive Formal Languages and Automata Package. Jones and Bartlett Publishers, Inc., USA.
  24. Tomás García Saiz & Elena Gaudioso Vázquez (2010): Autómatas, Gramáticas, y Lenguages Formales: Problemas Resueltos, 1st edition. Sanz Y Torres, S. L., España.
  25. Michael L. Scott (2000): Programming Language Pragmatics, 1 edition. Morgan Kaufmann Publishers.
  26. Timothy M. White & Thomas P. Way (2006): jFAST: A Java Finite Automata Simulator. SIGCSE Bull. 38(1), pp. 384–388, doi:10.1145/1124706.1121460.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org