#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1988

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- 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
- J. Comput. Syst. Sci.
- 1989

- Craig Alan Rich
- 2015

The complexity of two finite-state models, optimizing transducers and counting automata " (1988). Retrospective Theses and Dissertations. Paper 8800. The most advanced technology has been used to photo graph and reproduce this manuscript from the microfilm master. UMI films the original text directly fi-om the copy submitted. Thus, some dissertation copies… (More)

- Craig A. Rich
- 1993

Inheritance and genericity are programming language features which provide a concise and intuitive syntax for defining operations in terms of operations. They are perhaps the most distinguishing features of " object-oriented " programming languages. Several object-oriented languages contain or are being extended to contain both inheritance and genericity,… (More)

Thank you for accepting our paper entitled " The complexity of a counting finite-state automaton " publication in Acta Cybernetica. The following lines constitute a plain TeX source for producing our pa as it was originally submitted. Figure 4.1 was not produced by TeX, but was pasted in by hand. We mailing a hard copy of Figure 4.1 for inclusion. I am… (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)

- ‹
- 1
- ›