We continue the study of combinatorial property testing, initiatedby Goldreich, Goldwasser and Ron in [7]. The subject of this paper is testing regular languages. Our main result is as follows. For a regular language L ∈ {0, 1}∗ and an integer n there exists a randomized algorithm which always accepts a word w of length n if w ∈ L, and rejects it with high probability if w has to be modified in...

The pentacyclic triterpene 17 beta(H),21 beta(H)-hop-22(29)-ene (diploptene) occurs in sediments throughout the Columbia River drainage basin and off the southern coast of Washington state in concentrations comparable to long-chain plantwax n-alkanes. The same relationship is evident for diploptene and long-chain n-alkanes in soils from the Willamette Valley. Microorganisms indigenous to soil...

In Theorem 2, we shall show that the only integers having property P(n), where n is an odd positive integer, are -2, -1, 1, and 2. In Theorem 3, we shall determine the integers which have property P(n) , where n is an even positive integer. In particular, we shall show that: m has property P(4) iff m divides 240 = 2̂ 3 -5 m has property P(6) iff m divides 504 = 23 * 7 m has property P(8) iff m d...

In this paper, for a prime number , a construction method to generate -ary -form sequences with the ideal autocorrelation property is proposed and using the ternary sequences found by Helleseth, Kumar, and Martinsen, ternary -form sequences with the ideal autocorrelation property are constructed. By combining the methods for generating -ary extended sequences (a special case of geometric sequen...

For a given graph property Π (i.e., a collection Π of graphs), the Π-Contraction problem is to determine whether the input graph G can be transformed into a graph satisfying property Π by contracting at most k edges, where k is a parameter. In this paper, we mainly focus on the parameterized complexity of Π-Contraction problems for Π being H-free (i.e., containing no induced subgraph isomorphic...

The problem of computing all maximal induced subgraphs of a graph G that have a graph property P , also called the maximal P-subgraphs problem, is considered. This problem is studied for hereditary, connected-hereditary and rooted-hereditary graph properties. The maximal Psubgraphs problem is reduced to restricted versions of this problem by providing algorithms that solve the general problem, ...

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be additive hereditary properties of graphs. A (P ,Q)-total coloring ∗Research supported in part by Slovak VEGA Grant 2/0194/10. 210 M. Borowiecki, A. Kemnitz, M. Marangio and P. Mihók of a simple graphG is a coloring of the vertices V (G) and edgesE(G) of G...

We study the physical processes that create eroded channels and drainage networks by doing laboratory experiments. The apparatus consists of a sloping granular bed inside a 90 cm 119 cm 30 cm acrylic box. The granular material consists of 0.5 mm diameter glass beads. Water is fed from a reservoir in the back and the pressure is maintained at a constant level. The water seeps through the porous ...

In mono-modal logic there is a fair number of high-powered results on completeness covering large classes of modal systems, witness for example Fine [74,85] and Sahlqvist [75]. Mono-modal logic is therefore a well-understood subject in contrast to poly-modal logic where even the most elementary questions concerning completeness, decidability etc. have been left unanswered. Given that so many ap...

Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough results and led to development of new techniques both within the traditional P vs NP dichotomy and within parameterized complexity. The Π-Subgraph problem asks whether an input graph contains an induced subgraph on at...