The Complexity of a Counting Finite-State Automaton


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)
DOI: 10.1007/3-540-50517-2_83


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics