No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Abstract
TALFi nació en el curso académico 2008-2009 como una aplicación de apoyo y consulta sobre teoría de autómatas y lenguajes formales. Su primera versión contenía funcionalidad acerca de autómatas finitos (deterministas, no deterministas y con transiciones vacías), y expresiones regulares, así como su equivalencia, simplifcación y demás aspectos relacionados. Para TALFi 2.0 se han creado muchas más características adicionales, así como la mejora de ciertos aspectos de la primera versión, que no resultaban del todo intuitivos para el usuario y claros en la comprensión. Como nueva funcionalidad podemos encontrar el tratamiento de autómatas de pila, máquinas de Con esta nueva ampliación, TALFi se convierte en una herramienta de gran expresividad dentro del entorno de los autómatas y la generación de lenguajes, a la altura de otras tecnologías ya conocidas como JFLAP, etc. [ABSTRACT] TALFi was created in the academic course of 2008-2009 as a student support program for automaton theories and formal lenguages. Its rst version contained united-state automaton (deterministic, non-deterministic and generalized nondeterministic inite automaton) and regular expressions, so as their equivalence, simplicated and more related aspects. For TALFi 2.0 has been created a lot more of addicional options, as the improvement of some parts of the rst version, which was not completely intuitive for the user and clear in its comprehension. With this new ampliation, TALFi turns into a great tool into the automaton world and the language generations, in the same leves as JFLAP, etc.
ResearchGate has not been able to resolve any citations for this publication.
Introduction to Languages and the Theory of Computation is an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness. Through the study of these topics, students encounter profound computational questions and are introduced to topics that will have an ongoing impact in computer science. Once students have seen some of the many diverse technologies contributing to computer science, they can also begin to appreciate the field as a coherent discipline. A distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used. Martin takes advantage of the clarity and precision of mathematical language but also provides discussion and examples that make the language intelligible to those just learning to read and speak it. The material is designed to be accessible to students who do not have a strong background in discrete mathematics, but it is also appropriate for students who have had some exposure to discrete math but whose skills in this area need to be consolidated and sharpened.Table of contentsI Mathematical Notation and Techniques1 Basic Mathematical Objects2 Mathematical Induction and Recursive DefinitionsII Regular Languages and Finite Automata3 Regular Expressions and Finite Automata4 Nondeterminism and Kleene's Theorem5 Regular and Nonregular LanguagesIII Context-Free Languages and Pushdown Automata6 Context-Free Grammars7 Pushdown Automata8 Context-Free and Non-Context-Free LanguagesIV Turing Machines and Their Languages9 Turing Machines10 Recursively Enumerable LanguagesV Unsolvable Problems and Computable Functions11 Unsolvable Problems12 Computable FunctionsVI Introduction to Computational Complexity13 Measuring and Classifying Complexity14 Tractable and Intractable Problems
Traducción de: Automata and formal languages: an introduction Reimpresión en 1998
TABLA DE CONTENIDO
TABLA DE CONTENIDO
PARA QUE SIRVEN LOS AUTÓMATAS? AUTÓMATAS FIFNITOS EXPRESIONES Y LENGUAJES REGULARES PROPIEDADES DE LOS LENGUAJES REGULARES GRAMÁTICAS INDEPENDIENTES DEL CONTEXTO AUTÓMATAS A PILA PROPIEDADES DE LOS LENGUAJES INDEPENDIENTES DEL CONTEXTO INTRODUCCIÓN A LAS MÁQUINAS DE TURING PROBLEMAS INDECIDIBLES PROBLEMAS INTRATABLES OTRAS CLASES DE PROBLEMAS