Structured Frequency Algorithms
From MaRDI portal
Publication:2948453
DOI10.1007/978-3-319-17142-5_6zbMath1461.03032OpenAlexW802998027MaRDI QIDQ2948453
Jānis Iraids, Kaspars Balodis, Rūsiņš Freivalds
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_6
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time bounded frequency computations
- Regular frequency computations
- Frequency computations and the cardinality theorem
- Inductive inference of recursive functions: Qualitative theory
- The Theory of Automata, a Survey
- Probabilistic automata
This page was built for publication: Structured Frequency Algorithms
