S. Ali Dashti

Learn More
We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Π 0 1 class P is a subshift if and only if there is a computable function F mapping 2 N to 2 N such that P is the set of itineraries of elements of 2 N. Π 0 1 subshifts are constructed in 2 N and in 2 Z which have no computable elements. We(More)
We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor–Bendixson rank two contain only eventually periodic elements. Any rank two subshift in 2ℤ is decidable. Subshifts of rank three may contain members of arbitrary Turing degree. In contrast, effectively closed ( $\Pi^{0}_{1}$ ) subshifts of rank(More)
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any rank one subshift, in which every limit point is periodic, is decidable. Sub-shifts of rank two may contain members of arbitrary Turing degree. In contrast, effectively(More)
Neural Adaptive based on feedback linearization is used in this study to control the velocity and recognition of an electro hydraulic servo system (EHSS) in the presence of flow nonlinearities as well as internal friction and noise. This controller consists of four parts: PID controller, feedback linearization controller, neural network controller and the(More)
  • 1