Filtering by
- All Subjects: Automata Theory
- All Subjects: Uromastyx--Ecophysiology--Kuwait.
- Creators: Smith, Andrew
Results of this study showed that while body mass and body condition consistently diminished as the active season progressed, they were both greater in protected habitats compared to non-protected habitats, regardless of season. Dhubs surface activity and total body water decreased while evaporative water loss and body temperature increased as the active season progressed and ambient temperature got hotter. Total body water was also significantly affected by habitat protection.
Overall, this study revealed that, while habitat protection provided more vegetation, it had little effect on seasonal changes in surface activity. While resource availability in protected areas might allow for larger dhub populations, unprotected areas showed similar body morphometrics, activity, and body temperatures. By developing an understanding of how different coping strategies are linked to particular ecological, morphological, and phylogenetic traits, we will be able to make more accurate predictions regarding the vulnerability of species. By combining previous studies pertaining to conservation of protected species with the results of my study, a number of steps in ecosystem management are recommended to help in the preservation of dhubs in the Kuwaiti desert.
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.
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.
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.