Skip to main content

1 Result(s)

within Craig A. Rich Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    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 exa...

    Craig A. Rich, Giora Slutzki in Foundations of Software Technology and The… (1988)