Volume 145, Numbers 1&2, 10 July 1995
Ernst L. Leiss
: Implicit Language Equations: Existence and Uniqueness of Solutions.
: The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness.
, Robert Paige
: Using Multiset Discrimination to Solve Language Processing Problems Without Hashing.
: A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure.
: On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet.
: A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score.
: A Decomposition Theorem for Probabilistic Transition Systems.