Lenguajes y Autómatas: Una perspectiva funcional con Racket

Autores/as

Abdiel E. Cáceres González
https://orcid.org/0000-0003-2858-6069
DOI: https://doi.org/10.19136/book.152

Palabras clave:

Coding, Programación, DrRacket, Matemáticas, Programming, Mathematics

Sinopsis

Este libro es el resultado de algunos años de coleccionar y mejorar funciones que se han empleado en cursos de Lenguajes Formales y Autómatas, en la Universidad Juárez Autónoma de Tabasco, en México. El contenido de este material abarca diferentes temas fundamentales, desde lógica proposicional hasta la teoría clásica de autómatas finitos. El enfoque presentado es completamente práctico, programando casi todas las funciones matemáticas que usualmente se estudian solo en teoría, en la mayoría de los libros de texto. Se ha empleado el lenguaje de programación DrRacket para implementar las funciones matemáticas, porque es un lenguaje con una sintaxis muy simple y fácil de aprender, lo cual es sumamente útil para expresar en código las ideas y conceptos de la teoría de lenguajes formales y autómatas finitos.

 

Languages and Automatons: A functional perspective using Racket

This book results from many years collecting and improving functions used in teaching Formal Languages and Automatons in the Universidad Juárez Autónoma de Tabasco, México. The content encompasses different fundamental topics, from propositional logic through classic theory on finite automatons. The approach is fully practical, programming most of the mathematical functions that are usually studied only on theory, in most of the text books. The programming language, DrRacket, used for implementing the mathematical functions, has been selected because its syntaxis is simple and easy to learn, which is very useful for expressing through code the ideas and concepts of formal language and finite automatons theories.

Biografía del autor/a

Abdiel E. Cáceres González

Nació en la Ciudad de México. Es Licenciado en Computación por la Universidad Juárez Autónoma de Tabasco. Maestro en Ciencias en Ingeniería Eléctrica con opción en Computación por el Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Doctor en Ciencias en Ingeniería Eléctrica con opción en Computación por el Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional. Actualmente es Profesor investigador de tiempo completo en la Universidad Juárez Autónoma de Tabasco, en la División Académica de Ciencias Básicas. Miembro Profesional de la ACM (Association for Computing Machinery) desde 2007 y consultor independiente en temas de fundamentos teóricos de las ciencias computacionales, inteligencia artificial y métodos de optimización no convencionales.

He was born in Mexico City. He holds a degree in Computer Science from the Universidad Juárez Autónoma de Tabasco, earned his master’s degree in Electrical Engineering with option in Computer Science, and his doctorate in Electrical Engineering with an option in Computing from the Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional. He is currently a full-time Research Professor at the la Universidad Juárez Autónoma de Tabasco, in the Academic Division of Basic Sciences. He is a professional member of the ACM (Association for Computing Machinery), since 2007, and independent consultant on theoretical foundations of computational sciences, artificial intelligence and unconventional optimization methods.

Referencias

[Abb03] Janet Abbate. Women and Gender in the History of Computing.IEEE Annals of the History of Compu-ting, 25(4):4–8, Oct 2003.[Amb04] S.W. Ambler.The Object Primer: Agile Model-Driven Development with UML 2.0. Cambridge University Press, 2004.

[ASS96] H. Abelson, G. J. Sussman, and J. Sussman.Structure and Interpretation of Computer Programs. Electrical engineering and computer science series. Cambridge, MA, 1996.

[Ass16]Association for Computing Machinery. A. M. Turing Award. Web page athttp://amturing.acm.org/, 2016 (last visited on jul-2016).

[BM76]J. A. Bondy and U.S.R. Murty.Graph Theory with Applications. North Holland, 1976.

[BW57a] Arthur W. Burks and Hao Wang. The Logic of Automata – Part I.J. ACM, 4(2):193–218, apr 1957.

[BW57b] Arthur W. Burks and Hao Wang. The Logic of Automata – Part II.J. ACM, 4(3):279–297, jul 1957.

[Cer91]Paul E. Ceruzzi. When Computers Were Human.Annals of the History of Computing, 13(3):237–244,July 1991.

[Chu41]Alonzo Church.The Calculi of Lambda Conversion. Princeton University Press, Princeton, NJ, 1941.

[CLRS09] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.Introduction to Algorithms. MIT Press, 3 edition, 2009.

[FFF06]Matthew Flatt, Robert Bruce Findler, and Matthias Felleisen. Scheme with Classes, Mixins, and Traits(invited tutorial). InAsian Symposium on Programming Languages and Systems, 2006.http://www.cs.utah.edu/plt/publications/aplas06- fff.pdf.

[FP16]Mattew Flatt and PLT. The Racket Reference v.6.6. Creating Objects. On Line Reference athttps://docs.racket- lang.org/reference/objcreation.html?q=super- new, 2016.

[Gin68]Abraham Ginzburg.Algebraic Theory of Automata. ACM Monograph Series. Academic Press, 1968.

[Gri13]David Alan Grier.When Computers Were Humans. Princeton University Press, 2013. 424 pp.

[Har78]Michael A. Harrison.Introduction to Formal Language Theory. Addison-Wesley Longman PublishingCo., Inc., Boston, MA, USA, 1st edition, 1978.

[Hop71] John Hopcroft. Annlognalgorithm for minimizing states in a finite automaton. In A. Kohavi, Z. anf Paz,editor,Theory of machines and computers (Proc. Internat. Sympos., Technion Haifa), pages 189 – 196.Academic Press N.Y., 1971.

[HU79]John E. Hopcroft and Jefferey D. Ullman.Introduction to Automata Theory, Languages, and Compu-tation. Adison-Wesley Publishing Company, Reading, Massachusets, USA, 1979.

[Jak15]Sebastian Jakobi.Modern Aspects of Classical Automata Theory: Finite Automata, Biautomata, andLossy Compression. Logos Verlag Berlin, 2015.

[KKR05] Kenneth E. Kendall, Julie E. Kendall, and Antonio N. (Tr) Ramos.Análisis y Diseño de Sistemas.Pearson Educacón. Pearson Educación, 2005.

[Kle81]Stephen C. Kleene. The Theory of Recursive Functions, Approaching its Centennial.Bulletin (NewSeries) of the American Mathematical Society, 5(1):43 – 61, July 1981.

[Koe01]Teun Koetsier. On the Prehistory of Programmable Machines: Musical Automata, Looms, Calculators.Mechanism and Machine Theory, 36(5):589 – 603, 2001.

[Lan65a] Peter John Landin. Correspondence Between ALGOL 60 and Church’s Lambda-notation: Part I.Com-mun. ACM, 8(2):89–101, February 1965.

[Lan65b] Peter John Landin. Correspondence Between ALGOL 60 and Church’s Lambda-notation: Part II.Com-mun. ACM, 8(3):158–167, March 1965.

[Law03] Mark V. Lawson.Finite Automata. Chapman & Hall CRC press, 2003.

[LY08]Li Li and Yun Yang. E-Business Process Modelling with Finite State Machine Based Service Agents. InWeiming Shen, Jianming Yong, Yun Yang, Jean-Paul A. Barthès, and Junzhou Luo, editors,ComputerSupported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne,Australia, April 26-28, 2007. Revised Selected Papers, volume 5236 ofLecture Notes in ComputerScience, chapter Computer Supported Cooperative Work in Design IV, pages 261–272. Springer BerlinHeidelberg, Berlin, Heidelberg, 2008.

[McC78] John McCarthy. History of LISP.SIGPLAN Not., 13(8):217–223, aug 1978.

[Mea55] George H. Mealy. A Method for Synthesizing Sequential Circuits.Bell System Technical Journal, The,34(5):1045–1079, Sept 1955.

[MH81]A.N. Michel and C.J. Herget.Applied Algebra and Functional Analysis. Dover Books on Mathematics.Dover Publications, 1981.

[MM67] Marvin Minsky.Computation, Finite and Infinite Machines. Automatic Computation. Prentice-Hall Inc.NJ, 1967.

[Moh96] Mehryar Mohri. On Some Applications of Finite-State Automata Theory to Natural Language Proces-sing.Journal of Natural Language Engineering, 2, 1996.

[Moo56] Edward F. Moore. Gedanken-Experiments on Sequential Machines. In Claude Shannon and JohnMcCarthy, editors,Automata Studies, pages 129–153. Princeton University Press, Princeton, NJ, 1956.

[MP43]Warren S. McCulloch and Walter Harry Pitts. A Logical Calculus of the Idea Immanent in NervousActivity.Bulletin of Mathematical Biophysics, 5:115–133, 1943.

[NS03]Lev Naumov and Anatoly Shalyti. Automata Theory for Multi-Agent Systems Implementation. InProceedings of International Conference Integration of Knowledge Intensive Multi-Agent Systems: Modeling, Exploration and Engineering. KIMAS-03, volume Boston: IEEE Boston Section. 2003, pages 65– 70, 2003.

[Rea16]Real Academia Española.Diccionario de la lengua Española. Versión normal (Spanish Edition). Espasa,23 edition, 2016.

[RM04]K. H. Rosen and J. M. P. Morales.Matemática Discreta y sus Aplicaciones. McGraw-Hill, 5 edition,2004.

[Rog87]Hartley Rogers, Jr.Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge,MA, USA, 1987.

[RS59]Michael O. Rabin and Dana Stewart Scott. Finite Automata and Their Decision Problems.IBM J. Res.Dev., 3(2):114–125, apr 1959.

[Sha58]Claude E. Shannon. Von Neumann’s Contributions to Automata Theory.Bull. Amer. Math. Soc., 3 part2(64):123 – 129, 1958.

[Smu14] R.M. Smullyan.A Beginner’s Guide to Mathematical Logic. Dover Books on Mathematics. DoverPublications, 2014.

[YKSK05] Boris Yartsev, George Korneev, Anatoly Shalyto, and Vladimir Kotov. Automata-Based Programmingof the Reactive Multi-Agent Control Systems. In2005 International Conference on “Integration ofKnowledge Intensive Multiagent Systems. KIMAS ’05: Modeling, Exploration, and Engineering”, pages449 – 453, USA, MA, 2005. IEEE 2005.

[YYWL11] Jingdong Yang, Jinghui Yang, Weiguang Wang, and Gary (Ed) Lee.Advances in Automation andRobotics, Vol.2: Selected papers from the 2011 International Conference on Automation and Robotics(ICAR 2011), chapter An Efficient Path Planning Method Based on State Automata Model for MobileRobots, pages 181 – 188. Lecture Notes in Electrical Engineering. Springer Berlin Heidelberg, 2011.

[Zad13]L.A. Zadeh. Stochastic Finite-State Systems in Control Theory.Information Sciences, 251:1 – 9, 2013.

Descargas

Lenguajes y Autómatas: Una perspectiva funcional con Racket

Publicado

October 17, 2019

Colección

Héctor Ochoa Bacelis (Textos de enseñanza de Ciencias Básicas)

Categorías

Derechos de autor 2020 Universidad Juárez Autónoma de Tabasco

Detalles sobre esta monografía

ISBN-13 (15)

978-607-606-507-5

Cómo citar

Cáceres González, A. E. (2019). Lenguajes y Autómatas: Una perspectiva funcional con Racket. Universidad Juárez Autónoma de Tabasco. https://doi.org/10.19136/book.152