Pebble-depth
From MaRDI portal
Publication:6589837
Cites work
- scientific article; zbMATH DE number 4093436 (Why is no real title available?)
- scientific article; zbMATH DE number 3598362 (Why is no real title available?)
- scientific article; zbMATH DE number 1929941 (Why is no real title available?)
- scientific article; zbMATH DE number 3266639 (Why is no real title available?)
- Complexity results for two-way and multi-pebble automata and their logics
- Compression of individual sequences via variable-rate coding
- Computability and randomness
- Computational depth: Concept and applications
- Endliche Automaten und Zufallsfolgen
- Feasible Depth
- Finite state complexity
- Finite state incompressible infinite sequences
- Finite-state dimension
- Les probabilités denombrables et leurs applications arithmétiques.
- Normal numbers and finite automata
- Normality and two-way automata
- On encoding and decoding with two-way head machines
- On the difference between finite-state and pushdown depth
- On the polynomial depth of various sets of random strings
- Pebble Minimization of Polyregular Functions
- Polylog depth, highness and lowness for E
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
- Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
- Pushdown and Lempel-Ziv depth
- Recursive computational depth.
- Translation from classical two-way automata to pebble two-way automata
- Two-way pebble transducers for partial functions and their composition
- Typechecking for XML transformers
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)
