Relating automata to other fields

Authors:
Pradip Peter Dey;Mohammad Amin;Gordon W. Romney;Bhaskar Raj Sinha;Ronald F. Gonzales;Alireza Farahani;Hassan Badkoobehi
Affiliations:
National University, San Diego, CA;National University, San Diego, CA;National University, San Diego, CA;National University, San Diego, CA;National University, San Diego, CA;National University, San Diego, CA;National University, San Diego, CA
Venue:
Journal of Computing Sciences in Colleges
Year:
2012

Citing 16
Cited 1

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Model checking

Model checking
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Introduction to Computer Theory

Introduction to Computer Theory
Modeling Reactive Systems with Statecharts: The Statemate Approach

Modeling Reactive Systems with Statecharts: The Statemate Approach
Theory of Computing: A Gentle Introduction

Theory of Computing: A Gentle Introduction
Animation: can it facilitate?

International Journal of Human-Computer Studies - Special issue: Interactive graphical communication
Turning automata theory into a hands-on course

Proceedings of the 37th SIGCSE technical symposium on Computer science education
Theory of Computation (Texts in Computer Science)

Theory of Computation (Texts in Computer Science)
JFLAP: An Interactive Formal Languages and Automata Package

JFLAP: An Interactive Formal Languages and Automata Package
Automata Theory and Applications

Automata Theory and Applications
Introducing the Theory of Computation

Introducing the Theory of Computation
Introduction to Automata Theory, Languages, and Computation

Introduction to Automata Theory, Languages, and Computation
Learning with Animation: Research Implications for Design

Learning with Animation: Research Implications for Design
Concepts of Programming Languages

Concepts of Programming Languages
Elements of Automata Theory

Elements of Automata Theory

Rolling the dice on theory: one department's decision to strengthen the theoretical computing aspect of their curriculum

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automata classes including Turing Machines, Pushdown Automata and Finite Automata define the most elegant models of computation in terms of set processors. This study elaborates pedagogically motivated intuitive and formal relations between mathematical models and other computer science areas, so that students can relate different areas of computer science in a meaningful way. Cases that promote learning about theoretical models are presented with other related areas, such as programming languages, compilers and software design. Dynamic aspects of software can be appropriately modeled by certain automata based models. Visualizations are developed to help students in their initial stages of understanding of these relations. The visualizations demonstrate that mathematical models such as Pushdown Automata are reasonable processors of some programming language features such as balanced {'s and }'s which are evidently helpful in learning this kind of relation.