#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1988

1994

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Craig A. Rich
- J. Comput. Syst. Sci.
- 1989

- Craig A. Rich, Giora Slutzki
- Theor. Comput. Sci.
- 1994

An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states are either maximizing or minimizing. In a given state, the optimal output is the maximum or minimum—over all possible transitions—of the transition output concatenated with the optimal output of the resulting state. The ranges of optimizing finite-state… (More)

- Craig A. Rich, Giora Slutzki
- Acta Cybern.
- 1988

A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complexity of recognizing its range as a set of binary strings. We also… (More)

A counting finite-state automaton is a nondeterministic finite-state automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complexity of recognizing its range as a set of binary strings. We also… (More)

- ‹
- 1
- ›