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
Describing automata in terms of languages associated with their peripheral devices.
Describing automata in terms of languages associated with their peripheral devices.
automata theory: its relevance to computer science students and course contents
Proceedings of the 37th SIGCSE technical symposium on Computer science education
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)
Journal of Computing Sciences in Colleges
Automated verification: graphs, logic, and automata
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
We use the interactive symbolic software system, called FoLa (FOrmal Languages & Automata), for teaching formal languages, grammars, automata and related modern topics in theoretical computer science. We utilize symbolic techniques to develop an easy-to-use, portable and efficient software that can be used for both visualizing abstract theoretical models and for assisting the manipulation of the models of computers and computation. The software offers a unified approach for working with both fundamental topics of theoretical computer science such as formal languages, grammars, automata and Turing machines as well as modern applications of automata in model checking and automated program verification. ABFoLa also provides an environment that supports experimental research on formal languages, grammars, finite automata and infinite automata such as Buechi automata and alternating automata. The software 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 be used not only as a visual tool but also as a mathematical assistant for teaching and studying the subject. The software has been effectively used in some years for teaching courses on foundations of computer science.