#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1990

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kevin Cattell, Jon C. Muzio
- IEEE Trans. on CAD of Integrated Circuits and…
- 1996

This paper presents a method for the synthesis of a one-dimensional linear hybrid cellula from a given irreducible polynomial. A detailed description of the algorithm is given, toget the theoretical background. It is shown that two CA exist for each irreducible polynomial, open CA existence conjecture. An in-depth example of the synthesis is presented,… (More)

- Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers
- J. Algorithms
- 2000

Many applications call for exhaustive lists of strings subject to various constraints , such as inequivalence under group actions. A k-ary necklace is an Ž. equivalence class of k-ary strings under rotation the cyclic group. A k-ary unlabeled necklace is an equivalence class of k-ary strings under rotation and permutation of alphabet symbols. We present… (More)

- Kevin Cattell, Shujian Zhang
- J. Electronic Testing
- 1995

This letter is a supplement of the table of the minimal cost one-dimensional linear hybrid cellular automata with the maximum length cycle

- Kevin Cattell, Michael J. Dinneen
- ORDAL
- 1994

For the family of graphs with xed-size vertex cover k, we present all of the forbidden minors (obstructions), for k up to ve. We derive some results, including a practical nite-state recognition algorithm, needed to compute these obstructions.

- Kevin Cattell, Jon C. Muzio
- IEEE Trans. Computers
- 1996

The paper studies theoretical aspects of one dimensional linear hybrid cellular automata field. General results concerning the characteristic polynomials of such automata are pre synthesis algorithm for determining such a linear hybrid cellular automaton with a specific polynomial is given, along with empirical results and a theoretical analysis. Cyclic… (More)

- Kevin Cattell, Shujian Zhang, Micaela Serra, Jon C. Muzio
- IEEE Trans. Computers
- 1999

Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for nding obstructions by using a bounded treewidth (or… (More)

- Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
- Inf. Process. Lett.
- 1996

We described a simple algorithm running in linear time for each fixed constant, k, that either establishes that the pathwidth of a graph G is greater than k, or finds a path-decomposition of G of width at most O(zk). This provides a simple proof of the result by Bodlaender that many families of graphs of bounded pathwidth can be recognized in linear time.

- K. Cattell
- 1996

The increasing use of linear hybrid cellular automata LHCA in VLSI design and test and other applications for such purposes as pseudo random pattern generation has made it important for users to understand their design, use and properties. In this tutorial paper, the background for cellular automata is explained, and a recent synthesis algorithm with low… (More)

The searching of protein databases as a method of identifying newly sequenced genes is commonplace in molecular biology laboratories. However, it is a procedure that is not usually formally taught to students, and method cookbooks discuss it only briefly. This article uses a single family of highly diverged uracil-DNA glycosylases, which fall into two… (More)