Matching Items (15)
Filtering by

Clear all filters

162312-Thumbnail Image.jpg
ContributorsBuettner, Marie (Author) / Solis, Forrest (Thesis director) / Broglio, Ronald (Committee member) / School of Art (Contributor) / Barrett, The Honors College (Contributor) / Art (Painting) (Contributor)
Created2021-12
162313-Thumbnail Image.jpg
ContributorsBuettner, Marie (Author) / Solis, Forrest (Thesis director) / Broglio, Ronald (Committee member) / School of Art (Contributor) / Barrett, The Honors College (Contributor) / Art (Painting) (Contributor)
Created2021-12
162314-Thumbnail Image.jpg
ContributorsBuettner, Marie (Author) / Solis, Forrest (Thesis director) / Broglio, Ronald (Committee member) / School of Art (Contributor) / Barrett, The Honors College (Contributor) / Art (Painting) (Contributor)
Created2021-12
ContributorsAhearne, Matthew (Author) / Meirelles, Rodrigo (Thesis director) / Scott, Jason (Committee member) / Barrett, The Honors College (Contributor) / School of Art (Contributor) / School of Social Transformation (Contributor) / The Sidney Poitier New American Film School (Contributor)
Created2023-05
164915-Thumbnail Image.jpg
ContributorsMills, Alexander (Author) / Zhou, Xuesong (Thesis director) / Chen, Yinong (Committee member) / Barrett, The Honors College (Contributor) / Computing and Informatics Program (Contributor)
Created2022-05
164916-Thumbnail Image.jpg
ContributorsMills, Alexander (Author) / Zhou, Xuesong (Thesis director) / Chen, Yinong (Committee member) / Barrett, The Honors College (Contributor) / Computing and Informatics Program (Contributor)
Created2022-05
161048-Thumbnail Image.jpg
ContributorsHilliker, Jacob (Author) / Li, Baoxin (Thesis director) / Libman, Jeffrey (Committee member) / Barrett, The Honors College (Contributor) / Computer Science and Engineering Program (Contributor)
Created2021-12
Description

Among classes in the Computer Science curriculum at Arizona State University, Automata Theory is widely considered to be one of the most difficult. Many Computer Science concepts have strong visual components that make them easier to understand. Binary trees, Dijkstra's algorithm, pointers, and even more basic concepts such as arrays

Among classes in the Computer Science curriculum at Arizona State University, Automata Theory is widely considered to be one of the most difficult. Many Computer Science concepts have strong visual components that make them easier to understand. Binary trees, Dijkstra's algorithm, pointers, and even more basic concepts such as arrays all have very strong visual components. Not only that, but resources for them are abundantly available online. Automata Theory, on the other hand, is the first Computer Science course students encounter that has a significant focus on deep theory. Many
of the concepts can be difficult to visualize, or at least take a lot of effort to do so. Furthermore, visualizers for finite state machines are hard to come by. Because I thoroughly enjoyed learning about Automata Theory and parsers, I wanted to create a program that involved the two. Additionally, I thought creating a program for visualizing automata would help students who struggle with Automata Theory develop a stronger understanding of it.

ContributorsSmith, Andrew (Author) / Burger, Kevin (Thesis director) / Meuth, Ryan (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2021-12
Description

Among classes in the Computer Science curriculum at Arizona State University, Automata Theory is widely considered to be one of the most difficult. Many Computer Science concepts have strong visual components that make them easier to understand. Binary trees, Dijkstra's algorithm, pointers, and even more basic concepts such as arrays

Among classes in the Computer Science curriculum at Arizona State University, Automata Theory is widely considered to be one of the most difficult. Many Computer Science concepts have strong visual components that make them easier to understand. Binary trees, Dijkstra's algorithm, pointers, and even more basic concepts such as arrays all have very strong visual components. Not only that, but resources for them are abundantly available online. Automata Theory, on the other hand, is the first Computer Science course students encounter that has a significant focus on deep theory. Many
of the concepts can be difficult to visualize, or at least take a lot of effort to do so. Furthermore, visualizers for finite state machines are hard to come by. Because I thoroughly enjoyed learning about Automata Theory and parsers, I wanted to create a program that involved the two. Additionally, I thought creating a program for visualizing automata would help students who struggle with Automata Theory develop a stronger understanding of it.

ContributorsSmith, Andrew (Author) / Burger, Kevin (Thesis director) / Meuth, Ryan (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2021-12
ContributorsMunoz Zavala, Jaira (Author) / Weidner, Lauren (Thesis director) / Meeds, Andrew (Committee member) / Neubauer, Mary (Committee member) / Barrett, The Honors College (Contributor) / School of Mathematical and Natural Sciences (Contributor) / School of Art (Contributor)
Created2023-12