The polynomial time hierarchy collapses if the Boolean hierarchy collapses
SIAM Journal on Computing
The method of forced enumeration for nondeterministic automata
Acta Informatica
Query-limited reducibilities
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Information and Computation
A Downward Collapse within the Polynomial Hierarchy
SIAM Journal on Computing
A structural property of regular frequency computations
Theoretical Computer Science
Counting, Selecting, adn Sorting by Query-Bounded Machines
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
On Polynomially D-Verbose Sets
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Comparing Verboseness for Finite Automata and Turing Machines
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
ACM SIGACT News
Regular frequency computations
Theoretical Computer Science - Insightful theory
Resource Bounded Frequency Computations with Three Errors
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Kummer's cardinalitytheorem states that a language is recursive if a Turing machine can exclude for any n words one of the n + 1 possibilities for the number of words in the language. This paper gathers evidence that the cardinalitytheorem might also hold for finite automata. Three reasons are given. First, Beigel's nonspeedup theorem also holds for finite automata. Second, the cardinalitytheorem for finite automata holds for n = 2. Third, the restricted cardinalitytheorem for finite automata holds for all n.