Non-commutative Gröbner bases in algebras of solvable type
Journal of Symbolic Computation
Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Models of computation and formal languages
Models of computation and formal languages
An Introduction to Formal Languages and Automata
An Introduction to Formal Languages and Automata
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Elements of the Theory of Computation
Elements of the Theory of Computation
Mathematica: A System for Doing Mathematics by Computer? (Abstract)
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Describing automata in terms of languages associated with their peripheral devices.
Describing automata in terms of languages associated with their peripheral devices.
Turning automata theory into a hands-on course
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Interactive symbolic software for teaching formal languages, automata and beyond
Journal of Computing Sciences in Colleges
Hi-index | 0.00 |
We present an interactive computer algebra system, called FoLa (FOrmal Languages & Automata), for teaching and studying theoretical computer science. Formal languages, grammars, automata and related matters from the theory of computation are of considerable importance in the field of computer science because they cover the foundations and basic principles of computer science. The materials are also useful for important applications such as digital design, programming languages and compilers. However, for a long time pencil-and-paper has been the most commonly used tool for working with the subject, which makes the subject a very abstract one. In recent years, efforts have been made in order to develop computerized tools.The goal of this project is to use symbolic techniques from computer algebra for developing an easy-to-use, portable and efficient software which can be used for both visualizing abstract theoretical models and for assisting the manipulation of the models of computers and computation. By using advanced features from a general computer algebra system with its vast library of functions from set theory, graph theory, computer graphics, functions, relations, combinatorics, symbolic computation, mathematical reasoning and automated theorem proving, we are able to build a system which can offer a unified approach for working with both formal languages, grammars, automata and related matters.FoLa provides an environment that supports experimental research on formal languages, grammars, automata and related matters. The system does not have any restrictions on the alphabets, symbols, variables, the number of internal states, the size of input tapes or the number of input tapes. FoLa can also be used not only as a visual tool but also as a mathematical assistant for teaching and studying the subject. The software has been used since the year 2000 for teaching course on foundations of computer science at Lamar University.