# The Complexity of a Counting Finite-State Automaton

@article{Rich1988TheCO, title={The Complexity of a Counting Finite-State Automaton}, author={Craig A. Rich}, journal={Acta Cybern.}, year={1988}, volume={9}, pages={403-417} }

- Published 1988 in FSTTCS
DOI:10.1007/3-540-50517-2_83

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 consider the pumping behavior of counting finite-state automata. The class of functions computed by counting NFA’s (1) includes a class of… CONTINUE READING

#### From This Paper

##### Topics from this paper.

0 Citations

8 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-8 of 8 references