On every n-long input, every two-way finite automaton (fa) can reverse its head O(n) times before halting. A fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that requires Ω(2) states on every deterministic fa with few reversals, but only h states on a nondeterministic fa with few reversals.

In this paper, we show how the study of two-way automata on words may relevantly be extended to the study of two-way automata on one-dimensional overlapping tiles that generalize finite words. Indeed, over tiles, languages recognizable by finite two-way automata (resp. multi-pebble automata) coincide with languages definable by Kleene’s (resp. Kleene’s extended) regular expressions. As an immed...

This study was an attempt to investigate what metacognitive strategies are specifically employed by English learners when it comes to different speaking task types.60 students at advanced level (female) were randomly selected and given an OPT as a test of homogeneity. They were assigned to experimental and control groups. The MS questionnaire (Oxford, 1990) was also administered to see what MS ...

Remote sensing precipitation or from numerical weather prediction (NWP) is considered to be the best substitute for in situ ground observations flood simulations transboundary, data-scarce catchments. This research was aimed evaluate possibility of using a combination satellite product and NWP better forecasting transboundary Chenab River Basin (CRB) Pakistan. The gauge-calibrated product, i.e....