Patterns with Bounded Treewidth

We show that any parameter of patterns that is an upper bound for the treewidth of appropriate encodings of patterns as relational structures, if restricted to a constant, allows the membership problem for pattern languages to be solved in polynomial time. Furthermore, we identify a new such parameter, called the scope coincidence degree

On time versus space II

AbstractEvery t(n)-time bounded RAM (assuming the logarithmic cost measure) can be simulated by a t(n)/log t(n)-space bounded Turing machine and every t(n)-time bounded Turing machine with d-dimensional tapes by a t(n)5d·log∗t(n)/log t(n)-space bounded machine, where n is the length of the input. A class E of storage structures which generalizes multidimensional tapes is defined. Every t(n)-time bounded Turing machine whose storage structures are in E can be simulated by a t(n) loglog t(n)/log t(n)-space bounded Turing machine