A CA is discrete in both space and time, which means that in each time unit, the cells that constitute the CA represent one of a finite set of states. Abstract refers to the fact that a CA can be specified in purely mathematical terms. This computational model is both abstract and spatially and temporally discrete.Ĭomputational means the model can compute functions and solve algorithmic problems. Each cell is in one of a finite number of states. Characteristics of a cellular automatonĪ CA is a collection of colored cells or atoms on a grid of a specified shape. CAs have been suggested for possible use in public key cryptography, as well as for applications in geography, anthropology, political science, sociology and physics, among others. We will discuss benefits of visualization in automata theory learning and the software development life cycle of our proposed visualization tool in this report, and the experience derived from the implementation process will also be documented.A cellular automaton (CA) is a collection of cells arranged in a grid of specified shape, such that each cell changes state as a function of time, according to a defined set of rules driven by the states of neighboring cells. The modernized software is called GaniFA NG (Next Gener-ation) and enables designing finite automata and simulating all the functioning processes. In this thesis, we will study on modernization of an educational software called GaniFA which was developed for the visualization of finite automata at the end of 1990s. Since dynamic processes such as the working of an algorithm or the flow of informa-tion between computing entities are not well explained by static media styles like text or images visualization has a substantial role in effective learning. Interactive software visualizations are also valuable active learning techniques that can improve explorative learning in computer science. Visualization of software-related data deals with aspects that are connected with the visual representation of computational data sets or simulations in order to achieve a deeper understanding or a simpler representation of a more complex phe-nomenon. Software visualization is a promising field in computer science. An automated checking tool, known as ProofGrader, can be used to compare a student’s DFA with the correct DFA for a given language, thus greatly speeding up the grading of student assignments. A student’s DFA can be saved in an XML file and submitted for grading. Feedback is provided that either confirms that the DFA correctly meets the given conditions or alerts the student to a mismatch between the conditions and the DFA. A brute-force approach is then used to check that each state’s condition correctly describes all of the strings in its language and that none of the strings in a state’s language meet the condition for another state. Conditions that describe the language of each state are entered by the student in the form of conditional expressions with function calls and/or regular expressions. Because the states of a DFA partition the language over its alphabet into equivalence classes, each state has a language associated with it. Keyboard shortcuts, together with the use of a screen reader to voice the accessible descriptions provided by the program, allow visually impaired students to do the same. Sighted students use the mouse and graphical controls to draw and manipulate the DFA. ProofChecker is a graphical program based on the notion of formal correctness proofs that allows students, both sighted and visually impaired, to draw a deterministic finite automaton(DFA) and determine whether or not it correctly recognizes a given language.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |