We prove that the average complexity, for the uniform distribution on complete deterministic automata, of Moore’s state minimization algorithm is O(n log log n), where n is the number of states in the input automata.

We will consider the primitive para.llel operation of the Connection Machine, the Beta Operation. Let the input size of the problem be N and output size M. We will show how to perform the Beta Operation on an N-node hypercube in O(log N + log' h1) time. For a fi x fi mesh-of-trees, we require O(log N + a) time.

In this paper we derive a deterministic fast discrete Fourier transform algorithm for a 2π-periodic function f whose Fourier coefficients with significantly large magnitude are contained inside a support interval of length B. The algorithm is based on a method for the efficient recovery of B-sparse 2π-periodic functions presented by Iwen in [15]. If a good bound B on the support length is known...

the permeability is a main property of oil reservoirs that shows the ability of rocks in the conduct of fluids such as oil, water and gas through the pore spaces of reservoir. the determination of the permeability is a crucial task in reserve estimation, production and development of oil reservoirs. due to this, an accurate estimate of such important reservoir rock parameter should not be made ...

In this paper we show that if the input points to the geometric closest pair problem are given with limited precision (each coordinate is specified with O(log n) bits), then we can compute the closest pair in O(n log log n) time. We also apply our spatial decomposition technique to the k-nearest neighbor and n-body problems, achieving similar improvements. To make use of the limited precision o...

In this paper we focus on problems characterized by an input n-node tree and a collection of subpaths. Motivated by the fact that some of these problems admit a very good approximation (or even a poly-time exact algorithm) when the input tree is a path, we develop a decomposition theorem of trees into paths. Our decomposition allows us to partition the input problem into a collection of O(log l...

We present new algorithms for producing greedy parses for regular expressions (REs) in a semi-streaming fashion. Our lean-log algorithm executes in time O(mn) for REs of size m and input strings of size n and outputs a compact bit-coded parse tree representation. It improves on previous algorithms by: operating in only 2 passes; using only O(m) words of random-access memory (independent of n); ...

Usually, a parser for an LR(k)-grammar G is a deterministic pushdown transducer which produces backwards the unique rightmost derivation for a given input string x ∈ L(G). The best known upper bound for the size of such a parser is O(2|G||Σ| +k log |Σ|+log |G|) where |G| and |Σ| are the sizes of the grammar G and the terminal alphabet Σ, respectively. If we add to a parser the possibility to ma...

The paper presents the results of a simulation study, where log models based on CT scanned logs of Scots pine (Pinus sylvestris L.) was used as input material to a computer simulation model of a generic value chain involving sawing, drying, crosscutting and finger jointing. The aim was to investigate which factors that affect the volume yield in the value chain, be it forestal, log-, processor ...