The Complexity of a Counting Finite-State Automaton

  title={The Complexity of a Counting Finite-State Automaton},
  author={Craig A. Rich},
  journal={Acta Cybern.},
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
0 Citations
8 References
Similar Papers


Publications referenced by this paper.
Showing 1-8 of 8 references

The complexity of computing the permanent

  • Valiant, L.G
  • Theor. Comput. Sci. 8 (1979), 189–201.
  • 1979
3 Excerpts

The complexity of enumeration and reliablity problems

  • Valiant, L.G
  • SIAM J. Comput. 8: 3 (1979), 410–421. Special…
  • 1979
1 Excerpt

The Complexity of Decision Problems in Automata Theory and Logic

  • Stockmeyer, L.J
  • Doctoral Thesis, Dept. of Electrical Engineering…
  • 1974
1 Excerpt

Similar Papers

Loading similar papers…