Resource Bounded Frequency Computations with Three Errors
From MaRDI portal
Publication:3511315
DOI10.1007/978-3-540-69733-6_8zbMath1148.68371OpenAlexW2163484420MaRDI QIDQ3511315
Christoph Minnameier, Ulrich Hertrampf
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_8
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Frequency computation and bounded queries
- On frequency-enumerable sets
- Time bounded frequency computations
- A structural property of regular frequency computations.
- Recursion theoretic properties of frequency computation and bounded queries
- A proof of Beigel's cardinality conjecture
- The power of frequency computation
- The Theory of Automata, a Survey
This page was built for publication: Resource Bounded Frequency Computations with Three Errors