The language of machines: an introduction to computability and formal languages
The language of machines: an introduction to computability and formal languages
Automata and formal languages: an introduction
Automata and formal languages: an introduction
A framework to animate string algorithms
Information Processing Letters
Languages and machines: an introduction to the theory of computer science
Languages and machines: an introduction to the theory of computer science
A collection of tools for making automata theory and formal languages come alive
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
Models of computation and formal languages
Models of computation and formal languages
Using JFLAP to interact with theorems in automata theory
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Increasing visualization and interaction in the automata theory course
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Automata and Computability
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Interactive manipulation of regular objects with FAdo
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Hi-index | 0.89 |
We discuss how to increase and simplify the understanding of the equivalence relations between machine models and/or language representations of formal languages by means of the animation tool SAGEMoLiC. Our new educational tool permits the simulation of the execution of models of computation, as many other animation systems do, but its philosophy goes further than these of the usual systems since it allows for a true visualization of the key notions involved in the formal proofs of these equivalences. In contrast with the proposal of previous systems, our approach to visualize equivalence theorems is not a simple "step by step animation" of specific conversion algorithms between computational models and/or grammatical representations of formal languages, because we make emphasis on the key theoretical notions involved in the formal proofs of these equivalences.