The degree structure of complete sets under 2DFA reductions is investigated. It is shown that, for any class C that is closed under log-lin reductions: • All complete sets for the class C under 2DFA reductions are also complete under one-one, length-increasing 2DFA reductions and are first-order isomorphic. • The 2DFA-isomorphism conjecture is false, i.e., the complete sets under 2DFA reduction...

Digital technology is changing every aspect of life from how we communicate to the way we learn. International trends would suggest that digital access is becoming increasingly widespread in developed countries. But general trends may hide the fact that some households still do not have access to the internet for a variety of reasons. Differences in digital access and use, particularly along so...

A study was conducted which aimed to determine whether varying attractiveness and character integrity significantly affected the severity of the crime which participants associated with defendant portraits. Participants were shown attractive and unattractive portraits that were paired with a positive, negative or no-character statement. It was predicated that both variables would have effects o...

Mundlak shows that the fixed effects estimator is equivalent to random in one-way error component model once individual are modeled as a linear function of all averaged regressors over time. In spirit Mundlak, this paper result also holds for two-way and time functions across individuals. Wooldridge can be obtained pooled OLS with augmented by averages calls it estimator. While used GLS rather ...

77 THIS FEATURE PRESENTS A RELAtively unique concept for urban arterial highway interchanges. The interchange has been named the Echelon Interchange because of its symmetrical, but offset, pair of two-phase one-way pair intersections—one elevated over the other. An observer1 noted that the interchange resembled a flying formation used by the U.S. Navy Flight Demonstration Team, the “Blue Angels...

A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n)-state sweeping LasVegas automaton, but needs 2 states on every sweeping deterministic automaton.

A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. We say that a sweeping automaton is degenerate if the automaton has no left-moving transitions. We show that for each positive integer n, there is a nondeterministic finite automaton An over a two-letter alphabet such that An has n states, whereas the smallest equivalent nondegenerate swee...