Pebble-depth
From MaRDI portal
Publication:6589837
DOI10.1016/J.TCS.2024.114638MaRDI QIDQ6589837
Philippe Moser, Liam Jordon, Phil Maguire
Publication date: 20 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite state incompressible infinite sequences
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
- Finite state complexity
- Two-way pebble transducers for partial functions and their composition
- On encoding and decoding with two-way head machines
- Complexity results for two-way and multi-pebble automata and their logics
- Typechecking for XML transformers
- Les probabilités denombrables et leurs applications arithmétiques.
- Recursive computational depth.
- Finite-state dimension
- On the polynomial depth of various sets of random strings
- Normal numbers and finite automata
- Polylog depth, highness and lowness for E
- Normality and two-way automata
- Computational depth: Concept and applications
- Endliche Automaten und Zufallsfolgen
- Translation from classical two-way automata to pebble two-way automata
- On the Difference Between Finite-State and Pushdown Depth
- Compression of individual sequences via variable-rate coding
- Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
- Pebble Minimization of Polyregular Functions
- Feasible Depth
- Pushdown and Lempel-Ziv depth
This page was built for publication: Pebble-depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589837)
